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

A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints

Author

Listed:
  • Howard J. Weiss

    (Temple University)

Abstract

We present a greedy heuristic for the n job/1 machine scheduling problem with precedence constraints. This method is useful whenever the manager's optimization criteria is the sum of weighted or unweighted completion times, the sum of weighted or unweighted flow times, (with or without release dates), the sum of weighted or unweighted working times, the sum of weighted or unweighted lateness, average completion time, average flow time, average waiting time or average lateness. The greedy heuristic found the optimal solution for 58 of 68 test problems for which a branch and bound method was used to find the optimal solution. The heuristic is, of course, much easier to implement (and executes in less time). The greedy heuristic fared well in comparison with a simple myopic heuristic presented by Morton and Dharan (Morton. T. E., B. G. Dharan. 1978. Algoristics for single machine sequencing with precedence constraints. Management Sci. 24 (10) 1011--1020.).

Suggested Citation

  • Howard J. Weiss, 1981. "A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints," Management Science, INFORMS, vol. 27(10), pages 1209-1216, October.
    • Handle: RePEc:inm:ormnsc:v:27:y:1981:i:10:p:1209-1216
    DOI: 10.1287/mnsc.27.10.1209
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.27.10.1209
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.27.10.1209?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:27:y:1981:i:10:p:1209-1216. 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.