IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4614-5152-5_6.html
   My bibliography  Save this book chapter

The No-Wait Flow Shop

In: Flow Shop Scheduling

Author

Listed:
  • Hamilton Emmons

    (Case Western Reserve University)

  • George Vairaktarakis

    (Case Western Reserve University)

Abstract

After describing some real-world examples of flow shops with no waiting, we demonstrate the equivalence of no-wait and blocking in the shop with m = 2. For the no-wait shop, some research is available on the flow time objective while the majority of research focuses on the makespan objective. Hence, we start with a detailed discussion of an O(n log n) algorithm for F2|nwt|C max. For the makespan objective and m > 2 machines, we present a plethora of polynomially solvable special cases of the problem. Most interesting is the case with semi-ordered processing time matrices. In this case, a so called pyramidal schedule provides an optimal solution in O(n 2) time. Heuristic algorithms for m > 2 and the makespan objective show that the problem is intimately related to the traveling salesman problem. We survey the state of the art on metaheuristics. The problem is analyzed in the presence of lot streaming, with separable setup and teardown times, and in assemblytype and hybrid flow shops.

Suggested Citation

  • Hamilton Emmons & George Vairaktarakis, 2013. "The No-Wait Flow Shop," International Series in Operations Research & Management Science, in: Flow Shop Scheduling, edition 127, chapter 0, pages 189-220, Springer.
    • Handle: RePEc:spr:isochp:978-1-4614-5152-5_6
    DOI: 10.1007/978-1-4614-5152-5_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:isochp:978-1-4614-5152-5_6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.