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 repairbased 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.
Dynamic constraint satisfaction Hybrid flowshop Repair-based Rescheduling
Tieke Li Yongjun Xiao Haifeng Wang
School of Economics and Management University of Science and Technology Beijing Beijing, China
国际会议
2007 IEEE International Conference on Automation and Lofistics
山东济南
英文
2007-08-18（万方平台首次上网日期，不代表论文的发表时间）