An effective iterated greedy algorithm for blocking hybrid flow shop problem with due date window
Ahmed Missaoui & Younés Boujelbène
What the paper says
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.
27 citations
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.59 × 0.4 = 0.24 |
| M · momentum | 0.80 × 0.15 = 0.12 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.