Maximizing total job value on a single machine with job selection

Joonyup Eun, Chang Sup Sung, Eun Seok Kim

Research output: Contribution to journalArticle

Abstract

This paper describes a single-machine scheduling problem of maximizing total job value with a machine availability constraint. The value of each job decreases over time in a stepwise fashion. Several solution properties of the problem are developed. Based on the properties, a branch-And-bound algorithm and a heuristic algorithm are derived. These algorithms are evaluated in the computational study, and the results show that the heuristic algorithm provides effective solutions within short computation times.

Original languageEnglish
Pages (from-to)998-1005
Number of pages8
JournalJournal of the Operational Research Society
Volume68
Issue number9
DOIs
Publication statusPublished - 2017 Sep 1
Externally publishedYes

Keywords

  • branch-And-bound
  • heuristic
  • job value
  • scheduling
  • stepwise value function

ASJC Scopus subject areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing

Fingerprint Dive into the research topics of 'Maximizing total job value on a single machine with job selection'. Together they form a unique fingerprint.

  • Cite this