Hybrid Flow Shop with Setup Times Scheduling Problem

The two-stage hybrid flow shop problem under setup times is addressed in this paper. This NP-Hard. on the other hand, studied modeling different real-life applications especially manufacturing and high performance-computing. Tackling kind of requires development adapted algorithms. In context, a metaheuristic using genetic algorithm three heuristics are proposed These approximate solutions optimal solution parallel machines release delivery times. Indeed, these iterative procedures focusing each time particular stage where called to be solved. general then concatenation all stage. addition, lower bounds based relaxation method provided. present means evaluate efficiency developed algorithms throughout measurement relative gap. An experimental result discussed performance total, 8960 instances implemented tested show results given by heuristics. Several indicators compare between illustrated paper terms gap running time.