One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons

John J. Kanet ()
Additional contact information
John J. Kanet: Department of Management Information Systems, Operations Management, and Decision Sciences, University of Dayton, Dayton, Ohio 45469

Operations Research, 2014, vol. 62, issue 2, 345-347

Abstract: In 1969 H. Emmons provided three theorems (Emmons 1--3) for determining precedence relations between pairs of jobs for the single-machine tardiness problem. We show here a fourth straightforward theorem that uses the information when the jobs in the pair are both known to precede a third job in an optimum sequence. The new theorem augments the three Emmons theorems and is shown to be a generalization of a theorem by Elmaghraby.

Keywords: sequencing; production/scheduling; single machine; deterministic (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.2013.1253 (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:62:y:2014:i:2:p:345-347

Access Statistics for this article

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