IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v63y2015i2p351-352.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • John J. Kanet & Federico Della Croce & Christos Koulamas & Vincent T’kindt, 2015. "Erratum—One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons," Operations Research, INFORMS, vol. 63(2), pages 351-352, April.
  • Handle: RePEc:inm:oropre:v:63:y:2015:i:2:p:351-352
    DOI: 10.1287/opre.2015.1352
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2015.1352
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2015.1352?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Hamilton Emmons, 1969. "One-Machine Sequencing to Minimize Certain Functions of Job Tardiness," Operations Research, INFORMS, vol. 17(4), pages 701-715, August.
    2. John J. Kanet, 2014. "One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons," Operations Research, INFORMS, vol. 62(2), pages 345-347, April.
    3. A. H. G. Rinnooy Kan & B. J. Lageweg & J. K. Lenstra, 1975. "Minimizing Total Costs in One-Machine Scheduling," Operations Research, INFORMS, vol. 23(5), pages 908-927, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    2. Akturk, M. Selim & Ozdemir, Deniz, 2001. "A new dominance rule to minimize total weighted tardiness with unequal release dates," European Journal of Operational Research, Elsevier, vol. 135(2), pages 394-412, December.
    3. Silva, Marco & Poss, Michael & Maculan, Nelson, 2020. "Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 283(1), pages 70-82.
    4. Sen, Tapan & Sulek, Joanne M. & Dileepan, Parthasarati, 2003. "Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey," International Journal of Production Economics, Elsevier, vol. 83(1), pages 1-12, January.
    5. Louis-Philippe Bigras & Michel Gamache & Gilles Savard, 2008. "Time-Indexed Formulations and the Total Weighted Tardiness Problem," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 133-142, February.
    6. Somaye Geramipour & Ghasem Moslehi & Mohammad Reisi-Nafchi, 2017. "Maximizing the profit in customer’s order acceptance and scheduling problem with weighted tardiness penalty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 89-101, January.
    7. J. J. Kanet, 2007. "New Precedence Theorems for One-Machine Weighted Tardiness," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 579-588, August.
    8. Rostami, Salim & Creemers, Stefan & Leus, Roel, 2019. "Precedence theorems and dynamic programming for the single-machine weighted tardiness problem," European Journal of Operational Research, Elsevier, vol. 272(1), pages 43-49.
    9. Tan, K. C. & Narasimhan, R., 1997. "Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach," Omega, Elsevier, vol. 25(6), pages 619-634, December.
    10. John J. Kanet, 2014. "One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons," Operations Research, INFORMS, vol. 62(2), pages 345-347, April.
    11. Su, Ling-Huey & Chen, Chung-Jung, 2008. "Minimizing total tardiness on a single machine with unequal release dates," European Journal of Operational Research, Elsevier, vol. 186(2), pages 496-503, April.
    12. Tan, Keah-Choon & Narasimhan, Ram & Rubin, Paul A. & Ragatz, Gary L., 2000. "A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times," Omega, Elsevier, vol. 28(3), pages 313-326, June.
    13. Haiyan Wang & Chung‐Yee Lee, 2005. "Production and transport logistics scheduling with two transport mode choices," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 796-809, December.
    14. Roberto Cordone & Pierre Hosteins & Giovanni Righini, 2018. "A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 168-180, February.
    15. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    16. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    17. Koulamas, Christos, 1996. "Single-machine scheduling with time windows and earliness/tardiness penalties," European Journal of Operational Research, Elsevier, vol. 91(1), pages 190-202, May.
    18. Tian, Z. J. & Ng, C. T. & Cheng, T. C. E., 2005. "On the single machine total tardiness problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 843-846, September.
    19. Valente, Jorge M.S., 2007. "Improving the performance of the ATC dispatch rule by using workload data to determine the lookahead parameter value," International Journal of Production Economics, Elsevier, vol. 106(2), pages 563-573, April.
    20. Janiak, Adam & Krysiak, Tomasz, 2012. "Scheduling jobs with values dependent on their completion times," International Journal of Production Economics, Elsevier, vol. 135(1), pages 231-241.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:63:y:2015:i:2:p:351-352. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.