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 |
Fingerprint
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
Cite this
Maximizing total job value on a single machine with job selection. / Eun, Joonyup; Sung, Chang Sup; Kim, Eun Seok.
In: Journal of the Operational Research Society, Vol. 68, No. 9, 01.09.2017, p. 998-1005.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Maximizing total job value on a single machine with job selection
AU - Eun, Joonyup
AU - Sung, Chang Sup
AU - Kim, Eun Seok
PY - 2017/9/1
Y1 - 2017/9/1
N2 - 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.
AB - 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.
KW - branch-And-bound
KW - heuristic
KW - job value
KW - scheduling
KW - stepwise value function
UR - http://www.scopus.com/inward/record.url?scp=85021101759&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85021101759&partnerID=8YFLogxK
U2 - 10.1057/s41274-017-0238-z
DO - 10.1057/s41274-017-0238-z
M3 - Article
AN - SCOPUS:85021101759
VL - 68
SP - 998
EP - 1005
JO - Journal of the Operational Research Society
JF - Journal of the Operational Research Society
SN - 0160-5682
IS - 9
ER -