Dynamic constraint satisfaction approach to hybrid flowshop rescheduling

A dynamic constraint satisfaction problem (DCSP) model is established to describe the hybrid flowshop rescheduling problem under machine failures. Two objective functions are introduced to measure the similarity and the deviation of makespan between the new and the initial schedules. To solve the problem, a heuristic algorithm inspired by the idea of repair-based DCSP solving techniques is proposed. It can identify and eliminate the resource conflicts between related operations brought by the disruptions, and generate new schedule respecting the objective functions. Computational experiments have been conducted to evaluate the performance of the algorithm.