A GISMOO algorithm for a multi-objective permutation flowshop with sequence-dependent setup times

This paper presents a GISMOO algorithm adaptation to solve a multi-objective permutation flowshop with sequence-dependent setup times. The makespan and the total tardiness are the two objectives studied. Numerical experiments on various benchmarks from the literature were performed, to compare the performance of the adapted GISMOO algorithm with the NSGA-II algorithm. The results indicate that our algorithm generates better solutions than the known reference algorithms.