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

Dominance and Decomposition Heuristics for Single Machine Scheduling

Author

Listed:
  • Robert J. Chambers

    (Emory University, Atlanta, Georgia)

  • Robert L. Carraway

    (University of Virginia, Charlottesville, Virginia)

  • Timothy J. Lowe

    (The University of Iowa, Iowa City, Iowa)

  • Thomas L. Morin

    (Purdue University, West Lafayette, Indiana)

Abstract

New heuristic dominance rules and a flexible decomposition heuristic are developed for the problem of minimizing weighted tardiness on a single processor. Extensive computational experience demonstrates that, when our new heuristic dominance rules were incorporated into an optimal algorithm, optimal or nearly optimal solutions were obtained quickly. In fact, solution times were orders of magnitude faster than those using the optimal algorithm alone. On larger problems, our decomposition heuristic obtained better solutions than previous heuristics. Furthermore, on 50-job problems our decomposition heuristic obtained an optimal solution over ten times more often on the average than the best competing heuristic (22% versus 2% of the time). Since both our approaches are basically relaxations of optimal solution algorithms, they could easily be adapted for use in the solution of other scheduling problems.

Suggested Citation

  • Robert J. Chambers & Robert L. Carraway & Timothy J. Lowe & Thomas L. Morin, 1991. "Dominance and Decomposition Heuristics for Single Machine Scheduling," Operations Research, INFORMS, vol. 39(4), pages 639-647, August.
    • Handle: RePEc:inm:oropre:v:39:y:1991:i:4:p:639-647
    DOI: 10.1287/opre.39.4.639
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.4.639
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.39.4.639?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. 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.
    2. 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.
    3. Holsenback, J. E. & Russell, R. M. & Markland, R. E. & Philipoom, P. R., 1999. "An improved heuristic for the single-machine, weighted-tardiness problem," Omega, Elsevier, vol. 27(4), pages 485-495, August.
    4. Koulamas, Christos & Kyparisis, George J., 2019. "New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives," European Journal of Operational Research, Elsevier, vol. 278(1), pages 149-159.

    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:39:y:1991:i:4:p:639-647. 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.