IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v37y2025i2d10.1007_s10696-024-09548-8.html
   My bibliography  Save this article

On a bi-objective distributed permutation flow shop problem with batch processing machines

Author

Listed:
  • Oualid Elissaouy

    (University Hassan II of Casablanca, FST)

  • Karam Allali

    (University Hassan II of Casablanca, FST)

Abstract

This paper is devoted to a bi-objective distributed permutation flow shop problem with batch processing machines. We provide an industrial example illustrating this flow shop optimization issue that may be encountered in the textile sector, with particular focus on the process of T-shirt production. The tackled bi-objective function combines the maximum completion time (makespan) and the maximum tardiness. A weighting coefficient will be associated to each criterion in order to favor one or the other. The sequence independent setup time will be assumed in order to take into account the preparation of machines to process the different batches. Three metaheuristics have been used to address this problem. The first one is the iterated local search (ILS) metaheuristic, followed by the iterated greedy (IG) and finally the genetic algorithm (GA). The numerical simulations indicate that the developed IG metaheuristic performs better in terms of comparison to the other two algorithms ILS and GA for different size instances.

Suggested Citation

  • Oualid Elissaouy & Karam Allali, 2025. "On a bi-objective distributed permutation flow shop problem with batch processing machines," Flexible Services and Manufacturing Journal, Springer, vol. 37(2), pages 599-631, June.
    • Handle: RePEc:spr:flsman:v:37:y:2025:i:2:d:10.1007_s10696-024-09548-8
    DOI: 10.1007/s10696-024-09548-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-024-09548-8
    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/s10696-024-09548-8?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:flsman:v:37:y:2025:i:2:d:10.1007_s10696-024-09548-8. 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.