Lorenz dominance based metaheuristic to solve a hybrid flowshop scheduling problem with sequence dependent setup times

This paper deals with a multiobjective hybrid flowshop scheduling problem with sequence dependent setup times. Two different objectives are considered to be optimized at once. Our first contribution is to propose a special encoding for the studied problem. Then, our second contribution is that a new metaheuristic based on the Lorenz dominance relationship (L-NSGA) is developed here to solve the studied problem. The goal is to improve the search ability of the original metaheuristic which is based on the Pareto dominance relationship (NSGA-II). The experimental result shows the efficiency of L-NSGA to solve this problem.