IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v22y2024i1d10.1007_s10288-023-00535-7.html
   My bibliography  Save this article

An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times

Author

Listed:
  • Fernando Siqueira Almeida

    (University of Sao Paulo)

  • Marcelo Seido Nagano

    (University of Sao Paulo)

Abstract

In this article, we address the m-machine no-wait flow shop scheduling problem with sequence dependent setup times. The objective is to minimize total tardiness subject to an upper bound on makespan. Although these constraints and performance measures have all been extensively studied independently, they have never been considered together in this problem before. So, this multi-criteria approach provides more realistic solutions for complex scenarios. To solve the problem, we developed a new heuristic called $$IG_{A}$$ I G A . The proposed method repeatedly performs a process of destruction and construction of an existing solution in order to improve it. The novelty of this method includes a mechanism capable of adapting the destruction intensity according to the instance size and the number of iterations, calibrating the algorithm during the search. Computational experiments indicate that $$IG_{A}$$ I G A outperforms the best literature method for similar applications in overall solution quality by about 35%. Therefore, $$IG_{A}$$ I G A is recommended to solve the problem.

Suggested Citation

  • Fernando Siqueira Almeida & Marcelo Seido Nagano, 2024. "An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times," 4OR, Springer, vol. 22(1), pages 31-45, March.
    • Handle: RePEc:spr:aqjoor:v:22:y:2024:i:1:d:10.1007_s10288-023-00535-7
    DOI: 10.1007/s10288-023-00535-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-023-00535-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10288-023-00535-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:aqjoor:v:22:y:2024:i:1:d:10.1007_s10288-023-00535-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.