TY - JOUR
T1 - Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
AU - Federgruen, Awi
AU - Mosheiov, Gur
PY - 1994/11
Y1 - 1994/11
N2 - This paper addresses a class of single-machine scheduling problems with a common due-date for all jobs, and general earliness and tardiness costs. We show that a class of simple, polynomial, "greedy-type" heuristics can be used to generate close-to-optimal schedules. An extensive numerical study exhibits small optimality gaps. For convex cost structures, we establish that the worst-case optimality gap is bounded by e-i ≈ 0.36, if the due-date is non-restrictive.
AB - This paper addresses a class of single-machine scheduling problems with a common due-date for all jobs, and general earliness and tardiness costs. We show that a class of simple, polynomial, "greedy-type" heuristics can be used to generate close-to-optimal schedules. An extensive numerical study exhibits small optimality gaps. For convex cost structures, we establish that the worst-case optimality gap is bounded by e-i ≈ 0.36, if the due-date is non-restrictive.
KW - Deterministic scheduling
KW - General earliness and tardiness costs
KW - Greedy heuristics
KW - Worst-case optimality gaps
UR - http://www.scopus.com/inward/record.url?scp=0028548368&partnerID=8YFLogxK
U2 - 10.1016/0167-6377(94)90069-8
DO - 10.1016/0167-6377(94)90069-8
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0028548368
SN - 0167-6377
VL - 16
SP - 199
EP - 208
JO - Operations Research Letters
JF - Operations Research Letters
IS - 4
ER -