Scheduling a Bi-Objective Hybrid Flow Shop with Sequence-Dependent Family Setup Times Using Metaheuristics

This paper deals with the problem of hybrid flow shop scheduling. In this investigation, we considered group scheduling within the area of sequence-dependent family setup times and two objectives of minimizing makespan and total tardiness are taken into consideration simultaneously. Due to the computational complexity in solving these set of problems with multiple objectives, metaheuristics has a high priority, because these algorithms are capable of solving combinatorial problems in a reasonable time. This study focuses on three multi-objective algorithms, multi-objective genetic algorithm, sub-population genetic algorithm-II and non-dominated sorting genetic algorithm-II, to solve the mentioned problem. In order to investigate the effectiveness and efficiency of applying the noted metaheuristics for such an NP-hard problem, we evaluate non-dominated solution sets obtained via each algorithm through some evaluation metrics.