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

John J. Kanet (), Federico Della Croce (), Christos Koulamas () and Vincent T’kindt ()
Additional contact information
John J. Kanet: Department of Management Information Systems, Operations Management, and Decision Sciences, University of Dayton, Dayton, Ohio 45469
Federico Della Croce: DAUIN, Politecnico di Torino and CNR, IEIIT, 10129 Torino, Italy
Christos Koulamas: Department of Decision Sciences & Information Systems, Florida International University, Miami, Florida 33199
Vincent T’kindt: Universite François-Rabelais de Tours, Laboratoire d’Informatique (EA 6300), ERL CNRS OC 6305, 37200 Tours, France

Operations Research, 2015, vol. 63, issue 2, 351-352

Abstract: We clarify that Theorem 4 in Kanet (2014) [Kanet JJ (2014) One-machine sequencing to minimize total tardiness: A fourth theorem for Emmons. Oper. Res. 62(2):345–347] is not incremental to Theorem 3 of Emmons (1969) [Emmons H (1969) One-machine sequencing to minimize certain functions of job tardiness . Oper. Res. 17(4):701–715.] for the single-machine total tardiness problem.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.2015.1352 (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:63:y:2015:i:2:p:351-352

Access Statistics for this article

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