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

Development of M -Stage Decision Rule for Scheduling N Jobs Through M Machines

Author

Listed:
  • Richard A. Dudek

    (Texas Technological College, Lubbock)

  • Ottis Foy Teuton

    (Texas Technological College, Lubbock)

Abstract

This paper describes an algorithm that will yield an optimum sequence for n jobs requiring processing through M machines when no passing is allowed. Theoretical development utilizing combinatorial analysis precedes the algorithm and an example problem.

Suggested Citation

  • Richard A. Dudek & Ottis Foy Teuton, 1964. "Development of M -Stage Decision Rule for Scheduling N Jobs Through M Machines," Operations Research, INFORMS, vol. 12(3), pages 471-497, June.
    • Handle: RePEc:inm:oropre:v:12:y:1964:i:3:p:471-497
    DOI: 10.1287/opre.12.3.471
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.12.3.471
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.12.3.471?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. Jinliang Cheng & Hiroshi Kise & Hironori Matsumoto, 1997. "A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 96(3), pages 578-590, February.
    2. Framinan, Jose M. & Leisten, Rainer, 2006. "A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 28-40, February.
    3. Fernando Luis Rossi & Marcelo Seido Nagano, 2022. "Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1311-1346, December.
    4. Mitra, Manipushpak, 2005. "Incomplete information and multiple machine queueing problems," European Journal of Operational Research, Elsevier, vol. 165(1), pages 251-266, August.
    5. J M Framinan & J N D Gupta & R Leisten, 2004. "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1243-1255, December.
    6. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    7. Gupta, Jatinder N.D. & Stafford, Edward Jr., 2006. "Flowshop scheduling research after five decades," European Journal of Operational Research, Elsevier, vol. 169(3), pages 699-711, March.
    8. Zegordi, Seyed Hessameddin & Itoh, Kenji & Enkawa, Takao, 1995. "Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge," European Journal of Operational Research, Elsevier, vol. 85(3), pages 515-531, September.
    9. Marcello Urgo & Massimo Manzini, 2024. "An upper bound for the inter-exit time of two jobs in an m-machine flow shop," Annals of Operations Research, Springer, vol. 338(1), pages 379-405, July.
    10. F T Tseng & E F Stafford, 2008. "New MILP models for the permutation flowshop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1373-1386, October.

    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:12:y:1964:i:3:p:471-497. 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.