Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs

Awi Federgruen; Gur Mosheiov

doi:10.1016/0167-6377(94)90069-8

Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs

Awi Federgruen^*
, Gur Mosheiov

^*Corresponding author for this work

BA Business Department

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	199-208
Number of pages	10
Journal	Operations Research Letters
Volume	16
Issue number	4
DOIs	https://doi.org/10.1016/0167-6377(94)90069-8
State	Published - Nov 1994

Keywords

Deterministic scheduling
General earliness and tardiness costs
Greedy heuristics
Worst-case optimality gaps

Access to Document

10.1016/0167-6377(94)90069-8

Cite this

@article{b1b4064740984ea8a8cc7fd339791189,

title = "Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs",

abstract = "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.",

keywords = "Deterministic scheduling, General earliness and tardiness costs, Greedy heuristics, Worst-case optimality gaps",

author = "Awi Federgruen and Gur Mosheiov",

year = "1994",

month = nov,

doi = "10.1016/0167-6377(94)90069-8",

language = "אנגלית",

volume = "16",

pages = "199--208",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "4",

}

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 - https://www.scopus.com/pages/publications/0028548368

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 -

Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this