IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v74y2023i1p362-373.html
   My bibliography  Save this article

Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times

Author

Listed:
  • Fernando Siqueira de Almeida
  • Marcelo Seido Nagano

Abstract

We propose four algorithms for the no-wait flow shop scheduling problem. The objective is minimizing total completion time such that makespan is not greater than a maximum value. We address the problem with sequence-dependent setup times, an important production constraint that has never been considered for this problem before. The proposed algorithms start from an initial solution and then iterate through a process that destroys and repairs the incumbent solution in order to improve it. The methods are build combining distinct destruction and construction mechanisms, where the search intensification-diversification is explored at different levels. After an initial assessment, the best proposed algorithm (IG4) is chosen to be compared with three literature methods (PAL, TOB, ISA-2) developed for similar problems. Computational experiments revealed that the overall average relative percentage deviation of PAL, TOB, ISA-2, and IG4 are 10.97%, 4.44%, 2.07%, and 0.36%, respectively. The statistical analysis confirms that IG4 significantly outperforms the existing methods.

Suggested Citation

  • Fernando Siqueira de Almeida & Marcelo Seido Nagano, 2023. "Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(1), pages 362-373, January.
    • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:1:p:362-373
    DOI: 10.1080/01605682.2022.2039569
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2022.2039569
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2022.2039569?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.

    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:taf:tjorxx:v:74:y:2023:i:1:p:362-373. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.