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

Blocking or Limited Buffers in Flow Shops

In: Flow Shop Scheduling

Author

Listed:
  • Hamilton Emmons

    (Case Western Reserve University)

  • George Vairaktarakis

    (Case Western Reserve University)

Abstract

We begin by reviewing many manufacturing and other applications of the flow shop with limited or no interstage storage. For two machines, we show the equivalence of no storage (blocking) and no waiting, which have a polynomial solution; for m > 2, we establish that the flow shop with blocking is NP-complete. An integer program is given to find the minimum makespan. A variety of bounds are presented. Branch-and-bound algorithms using these bounds are given and evaluated. Various heuristics and metaheuristics are presented and compared. Two different precedence graphs are introduced and used in the above developments. The total tardiness objective is also discussed.

Suggested Citation

  • Hamilton Emmons & George Vairaktarakis, 2013. "Blocking or Limited Buffers in Flow Shops," International Series in Operations Research & Management Science, in: Flow Shop Scheduling, edition 127, chapter 0, pages 221-245, Springer.
    • Handle: RePEc:spr:isochp:978-1-4614-5152-5_7
    DOI: 10.1007/978-1-4614-5152-5_7
    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.

    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:spr:isochp:978-1-4614-5152-5_7. 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.