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

A General Algorithm for Solution of the n -Job, M -Machine Sequencing Problem of the Flow Shop

Author

Listed:
  • Richard D. Smith

    (Texas Technological College, Lubbock, Texas)

  • Richard A. Dudek

    (Texas Technological College, Lubbock, Texas)

Abstract

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

Suggested Citation

  • Richard D. Smith & Richard A. Dudek, 1967. "A General Algorithm for Solution of the n -Job, M -Machine Sequencing Problem of the Flow Shop," Operations Research, INFORMS, vol. 15(1), pages 71-82, February.
    • Handle: RePEc:inm:oropre:v:15:y:1967:i:1:p:71-82
    DOI: 10.1287/opre.15.1.71
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.15.1.71
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.15.1.71?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. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.

    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:15:y:1967:i:1:p:71-82. 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.