A decomposition-based kernel of Mallows models algorithm for bi- and tri-objective permutation flowshop scheduling problem

In the last decades, the permutation flowshop scheduling problem (PFSP) has been thoroughly studied in combinatorial optimization and scheduling research. The most common objectives for this problem are makespan, total flowtime, and total tardiness. Furthermore, most production scheduling problems naturally involve multiples conflicting objectives to be optimized. Over the years, several approaches have been proposed to solve multi-objective PFSP. In the multi-objective optimization field of research, the multi-objective evolutionary algorithms based on decomposition has been recognized as one of the main strategies for solving multi-objective optimization problems. In this paper, we present a MOEA that integrates the decomposition approach and a probability model for ranking data (particularly, the Mallows model) for solving PFSP minimizing two and three objectives. We have conducted an extensive experimental study using a well-known benchmark set. In the bi-objective case, the proposed algorithm achieves competitive results compared to the best-known approximated Pareto fronts from the literature. In the tri-objective scenario, our algorithm achieves the best results in comparison to some state-of-the-art decomposition-based algorithms.