IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i7d10.1057_palgrave.jors.2601384.html
   My bibliography  Save this article

Insights into two solution procedures for the single machine tardiness problem

Author

Listed:
  • J T Naidu

    (Philadelphia University)

  • J N D Gupta

    (The University of Alabama in Huntsville)

  • B Alidaee

    (University of Mississippi)

Abstract

This paper explores the well-known modified due date (MDD) rule for minimizing total tardiness on a single machine and shows that it has a decomposition structure. Based on this finding, we propose a decomposition heuristic and draw parallels to the famous optimal decomposition algorithm. We demonstrate that the MDD rule and the decomposition algorithm have striking similarities. We also discuss the key differences between these procedures. Finally, we present a sufficient condition under which the MDD rule is optimal and conclude the paper with some directions for future research.

Suggested Citation

  • J T Naidu & J N D Gupta & B Alidaee, 2002. "Insights into two solution procedures for the single machine tardiness problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(7), pages 800-806, July.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:7:d:10.1057_palgrave.jors.2601384
    DOI: 10.1057/palgrave.jors.2601384
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601384
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601384?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Koulamas, Christos, 2010. "The single-machine total tardiness scheduling problem: Review and extensions," European Journal of Operational Research, Elsevier, vol. 202(1), pages 1-7, April.

    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:pal:jorsoc:v:53:y:2002:i:7:d:10.1057_palgrave.jors.2601384. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.