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

The m-Machine Flow Shop

In: Flow Shop Scheduling

Author

Listed:
  • Hamilton Emmons

    (Case Western Reserve University)

  • George Vairaktarakis

    (Case Western Reserve University)

Abstract

Considered to be a very general case of flow shop systems, the m-machine flow shop is the most researched system in all of flow shop theory. Beyond solving the problem under a variety of objectives and side constraints, the m-machine flow shop serves as a test bed for new methodological tools. Regarding solutions, the research presented in this chapter is rich in lower bounding schemes, dominance properties, heuristic algorithms and computational experiments measuring their success. The models considered not only deal with all the standard regular performance measures, but also application-specific objective functions. A lot of work is also available on problems with multiple objectives. We find that the most successful solutions on problems of practical size are due to metaheuristic implementations including simulated annealing, tabu search and genetic algorithms. In contrast, branch-and-bound algorithms are mostly inadequate.

Suggested Citation

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