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

Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem

Author

Listed:
  • Wlodzimierz Szwarc

    (University of Wisconsin, Milwaukee, Wisconsin)

Abstract

Consider the 3 × n flow-shop problem with machines A , B , and C . By AB and BC optimum we mean optimal solutions produced by Johnson's method for the two-machine problems AB and BC , respectively. Although not every permutation that is an AB and BC optimum simultaneously is an optimal solution of the entire problem, the set P of such permutations does contain an ABC optimum whenever it is not empty. We summarize known analytical results and solution procedures for the 3 × n flow-shop problem.

Suggested Citation

  • Wlodzimierz Szwarc, 1977. "Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem," Operations Research, INFORMS, vol. 25(1), pages 70-77, February.
  • Handle: RePEc:inm:oropre:v:25:y:1977:i:1:p:70-77
    DOI: 10.1287/opre.25.1.70
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.25.1.70
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.25.1.70?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
    ---><---

    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:25:y:1977:i:1:p:70-77. 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.