Sequencing with Earliness and Tardiness Penalties: A Review

Kenneth R. Baker and Gary D. Scudder
Additional contact information
Kenneth R. Baker: Dartmouth College, Hanover, New Hampshire
Gary D. Scudder: The University of Minnesota, Minneapolis, Minnesota

Operations Research, 1990, vol. 38, issue 1, 22-36

Abstract: We consider the problem of scheduling n jobs to minimize the total earliness and tardiness penalty. We review the literature on this topic, providing a framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date. To this base we add such features as parallel machines, complex penalty functions and distinct due dates. We also consolidate many of the existing results by proving general forms of two key properties of earliness/tardiness models.

Keywords: production/scheduling:; deterministic; sequencing (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (163)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.1.22 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:1:p:22-36

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().