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

Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks

Author

Listed:
  • Kenneth R. Baker

    (Duke University, Durham, North Carolina)

  • Linus E. Schrage

    (University of Chicago, Chicago, Illinois)

Abstract

We discuss the dynamic programming approach to finding an optimal sequence of a set of tasks when the tasks are related by precedence restrictions. We describe how to use this approach in problems where no explicit precedence relations exist. Computer implementation considerations played an important role in its development. Computational results indicate that, when the curse of dimensionality can be dispelled, dynamic programming can be a useful procedure for large sequencing problems.

Suggested Citation

  • Kenneth R. Baker & Linus E. Schrage, 1978. "Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks," Operations Research, INFORMS, vol. 26(1), pages 111-120, February.
    • Handle: RePEc:inm:oropre:v:26:y:1978:i:1:p:111-120
    DOI: 10.1287/opre.26.1.111
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.26.1.111
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.26.1.111?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. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    2. John J. Kanet, 2014. "One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons," Operations Research, INFORMS, vol. 62(2), pages 345-347, April.
    3. Tanaka, Shunji & Sato, Shun, 2013. "An exact algorithm for the precedence-constrained single-machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 229(2), pages 345-352.
    4. Chengbin Chu, 1992. "A branch‐and‐bound algorithm to minimize total tardiness with different release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 265-283, March.
    5. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    6. 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.

    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:oropre:v:26:y:1978:i:1:p:111-120. 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.