Rescheduling algorithm based on rolling horizon decomposition for a dynamic job shop with uncertain arriving time
- Publication Type:
- Journal Article
- Jixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering, 2008, 44 (5), pp. 68 - 75
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
The dynamic job shop scheduling with uncertain arriving time is studied, and the objective is to minimize total tardiness of all jobs. When rescheduling is frequent, the computational efficiency of the scheduling algorithm is necessarily high. Based on the rolling horizon decomposition, the critical operation set is denoted. A hybrid genetic algorithm is proposed to determine the critical operation set as well as optimizing total tardiness. The hybrid scheduler is used to convert the chromosome into partially feasible schedule, and the improved modified operation rule is used to determine the sequence of the remaining operations out of the chromosome. Then the fitness is evaluated by the objective value of the complete scheduling for the total operations to process. The simulation results of many instances show that the proposed algorithm significantly improves the computational efficiency compared with the genetic algorithm based on the complete operation set, and the performance of scheduling is satisfying.
Please use this identifier to cite or link to this item: