An effective iterated greedy algorithm for blocking hybrid flow shop problem with due date window

Nowadays many industry consider an interval time as a due date instead of precise points in time. In this study, the hybrid flow shop scheduling problem with basic blocking constraint is tackled. Where jobs, if done within a due window, are deemed on time. Therefore, the criterion is to minimize the sum of weighted earliness and tardiness. This variant of the hybrid flowshop problem is not investigated to the best of our knowledge. we introduced a new metaheuristic centered on the iterated greedy approach. to evaluate the proposed method we start by the re-implementation and the comparison of seven well-selected procedures that treat the hybrid flowshop problem. In order to prove the robustness of our method, we evaluated it using a new benchmark of more than 1000 instances. The experimental results demonstrated that the proposed algorithm is effective and produces a very high solution.

Automated summary

This study addresses the hybrid flow shop scheduling problem and introduces a new metaheuristic approach based on the iterated greedy method. Experimental results demonstrate the effectiveness and high solution quality of the proposed algorithm.