The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as from multi-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependent setup times are considered. As setup times and multi-criteria problems are important in industry, we must focus on this area. We propose a simple, yet powerful algorithm for the sequence dependent setup times flowshop problem with several criteria. The presented method is referred to as Restarted Iterated Pareto Greedy or RIPG and is compared against the best performing approaches from the relevant literature. Comprehensive computational and statistical analyses are carried out in order to demonstrate that the proposed RIPG method clearly outperforms all other algorithms and, as a consequence, it is a state-of-Art method for this important and practical scheduling problem

Ciavotta, M., Minella, G., & Ruiz, R. (2013). Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 227(2), 301-313 [10.1016/j.ejor.2012.12.031].

Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study

Ciavotta, M;
2013

Abstract

The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as from multi-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependent setup times are considered. As setup times and multi-criteria problems are important in industry, we must focus on this area. We propose a simple, yet powerful algorithm for the sequence dependent setup times flowshop problem with several criteria. The presented method is referred to as Restarted Iterated Pareto Greedy or RIPG and is compared against the best performing approaches from the relevant literature. Comprehensive computational and statistical analyses are carried out in order to demonstrate that the proposed RIPG method clearly outperforms all other algorithms and, as a consequence, it is a state-of-Art method for this important and practical scheduling problem
Articolo in rivista - Articolo scientifico
Iterated greedy, Multi-objective, Permutation flowshop, Scheduling, Sequence dependent setup times
English
301
313
13
Ciavotta, M., Minella, G., & Ruiz, R. (2013). Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 227(2), 301-313 [10.1016/j.ejor.2012.12.031].
Ciavotta, M; Minella, G; Ruiz, R
File in questo prodotto:
File Dimensione Formato  
EJOR2013.pdf

Solo gestori archivio

Dimensione 1.06 MB
Formato Adobe PDF
1.06 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/186635
Citazioni
  • Scopus 79
  • ???jsp.display-item.citation.isi??? 71
Social impact