A simulated annealing metaheuristic approach to hybrid flow shop scheduling problem

Abstract

This study investigates a complex hybrid flow shop scheduling problem prevalent in the industrial sector, characterized by dedicated machines, availability dates, and delivery times. The primary objective is to minimize the total completion time (makespan) in a two-stage workshop setting. We conducted a comprehensive literature review, revealing a scarcity of research on this specific configuration, and employed the Simulated Annealing metaheuristic as our main resolution method. Special emphasis was placed on the meticulous parameterization and configuration of this metaheuristic, crucial for navigating the complexity of the problem. Our findings demonstrate the remarkable effectiveness of the Simulated Annealing method, particularly in achieving low deviation from the lower bound in larger problem sizes and specific instance classes. This consistency highlights the method’s robustness and suitability for complex scheduling scenarios. The study also reveals varying degrees of problem solvability across different instance classes, with computation times generally reasonable except in more challenging scenarios.