IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v35y1989i2p177-191.html
   My bibliography  Save this article

The Single Machine Early/Tardy Problem

Author

Listed:
  • Peng Si Ow

    (Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania 15213-3890)

  • Thomas E. Morton

    (Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania 15213-3890)

Abstract

We examine the problem of scheduling a given set of jobs on a single machine to minimize total early and tardy costs. Two dispatch priority rules are proposed and tested for this NP-complete problem. These were found to perform far better than known heuristics that ignored early costs. For situations where the potential cost savings are sufficiently high to justify more sophisticated techniques, we propose a variation of the Beam Search method developed by researchers in artificial intelligence. This variant, called Filtered Beam Search, is able to use priority functions to search a number of solution paths in parallel. A computational study showed that this search method was not only efficient but also consistent in providing near-optimal solutions with a relatively small search tree. The study also includes an investigation of the impacts of Beam Search parameters on three variations of Beam Search for this problem.

Suggested Citation

  • Peng Si Ow & Thomas E. Morton, 1989. "The Single Machine Early/Tardy Problem," Management Science, INFORMS, vol. 35(2), pages 177-191, February.
    • Handle: RePEc:inm:ormnsc:v:35:y:1989:i:2:p:177-191
    DOI: 10.1287/mnsc.35.2.177
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.35.2.177
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.35.2.177?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
    ---><---

    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:ormnsc:v:35:y:1989:i:2:p:177-191. 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: 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.