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

Reentrant Flow Shops

In: Flow Shop Scheduling

Author

Listed:
  • Hamilton Emmons

    (Case Western Reserve University)

  • George Vairaktarakis

    (Case Western Reserve University)

Abstract

We introduce flow shops that revisit certain processors, and define the common patterns of flow: cyclic, chain, hub, and V-shaped. We show that even the simplest case, the (1,2,1)-reentrant shop, is NPhard, establish properties that facilitate a branch-and-bound algorithm, and present two simple but very effective heuristics. With m machines, we give for chain-reentrance simplifying properties, for hub-reentrance a DP based on simplifying assumptions that yet performs well, for Vreentrance a solvable special case. For cyclic production of a single product in the general m-machine reentrant shop, we give an algorithm for finding the efficient frontier between cycle time and flow time, and a heuristic for larger instances. For the hybrid reentrant system, if all jobs require the same time for each production step but have different due dates, dispatching rules are recommended and compared.

Suggested Citation

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nazim Sami & Karim Amrouche & Mourad Boudhar, 2024. "New efficient algorithms for the two-machine no-wait chain-reentrant shop problem," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-29, July.

    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_9. 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.