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

Algoristics for Single-Machine Sequencing with Precedence Constraints

Author

Listed:
  • Thomas E. Morton

    (Carnegie-Mellon University)

  • Bala Ganga Dharan

    (Carnegie-Mellon University)

Abstract

Although Horn, Sidney and Lawler have considered the problem of minimizing weighted mean flow time for n jobs with precedence constraints on one machine, practical exact algorithms for the general case remain elusive. Two relatively sophisticated heuristics are presented which are computationally attractive. Each is optimal on large subclasses of problems; computational study demonstrates each to be extremely close to optimal in general. Such heuristics are dubbed "algoristics." The first-come first-served heuristic serves as a benchmark. Finally, a simple "myopic" heuristic produces about 80% of the savings of the algoristics; it possesses the advantages of a dispatching rule. A standard branch and bound procedure has also been computed for a large subset of problems for comparison purposes. Planning horizon results are also derived.

Suggested Citation

  • Thomas E. Morton & Bala Ganga Dharan, 1978. "Algoristics for Single-Machine Sequencing with Precedence Constraints," Management Science, INFORMS, vol. 24(10), pages 1011-1020, June.
    • Handle: RePEc:inm:ormnsc:v:24:y:1978:i:10:p:1011-1020
    DOI: 10.1287/mnsc.24.10.1011
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. P. Detti & D. Pacciarelli, 2001. "A branch and bound algorithm for the minimum storage‐time sequencing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 313-331, June.
    2. Suresh Chand & Vernon Ning Hsu & Suresh Sethi, 2002. "Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography," Manufacturing & Service Operations Management, INFORMS, vol. 4(1), pages 25-43, September.

    More about this item

    Statistics

    Access and download statistics

    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:24:y:1978:i:10:p:1011-1020. 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.