IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-28697-6_31.html
   My bibliography  Save this book chapter

An Iterated Local Search for a Re-entrant Flow Shop Scheduling Problem

In: Operations Research Proceedings 2014

Author

Listed:
  • Richard Hinze

    (University of Applied Sciences Merseburg)

  • Dirk Sackmann

    (University of Applied Sciences Merseburg)

Abstract

This paper discusses a re-entrant permutation flow shop scheduling problem with missing operations. The two considered objective functions are makespan and total flow time. Re-entrant flows are characterized by a multiple processing of jobs on more than one machine. We propose a heuristic for solving the problem. Since there have been promising approaches in literature on other scheduling problems, we chose the iterated local search (ILS). This meta-heuristic framework combines the advantages of local search algorithm and still tries to avoid being stuck in local optima by a so called shaking step. The initial solution for the ILS is obtained by a dispatching rule. Various rules have been tested, e.g., total job processing time and total processing time of job levels. A hill climbing algorithm has been implemented as the integrated local search method of the ILS. The ILS is compared to a MIP formulation from literature. The results show, that the ILS can deliver better results.

Suggested Citation

  • Richard Hinze & Dirk Sackmann, 2016. "An Iterated Local Search for a Re-entrant Flow Shop Scheduling Problem," Operations Research Proceedings, in: Marco Lübbecke & Arie Koster & Peter Letmathe & Reinhard Madlener & Britta Peis & Grit Walther (ed.), Operations Research Proceedings 2014, edition 1, pages 221-226, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-28697-6_31
    DOI: 10.1007/978-3-319-28697-6_31
    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:oprchp:978-3-319-28697-6_31. 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.