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

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.