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 language | English |
|---|---|
| Pages (from-to) | 998-1005 |
| Number of pages | 8 |
| Journal | Journal of the Operational Research Society |
| Volume | 68 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - 2017 Sep 1 |
| Externally published | Yes |
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
Eun, J., Sung, C. S., & Kim, E. S. (2017). Maximizing total job value on a single machine with job selection. Journal of the Operational Research Society, 68(9), 998-1005. https://doi.org/10.1057/s41274-017-0238-z