Reactive scheduling approach for solving a realistic flexible job shop scheduling problem

Author(s):  
B. Mihoubi ◽  
B. Bouzouia ◽  
M. Gaham
2014 ◽  
Vol 620 ◽  
pp. 668-675 ◽  
Author(s):  
Jun Liang Wang ◽  
Jie Zhang ◽  
Wei Qin

This article investigates the flexible job-shop scheduling problem (FJSP) with multi-uncertain. A proactive-reactive scheduling mechanism is put forward to against the fluctuating process time and equipment breakdowns. This mechanism consists of two stages, including proactive scheduling stage and reactive scheduling stage. In the proactive scheduling stage, the redundancy-based technique is used to generate robust baseline schedules; in the reactive scheduling stage, a reactive scheduling is adopted to rectify the predictive scheduling to adapt to the occurrence of machine failures. Based on this, an integrating algorithm is presented with the goal of the make span. Numerical experiments show that the proposed algorithm has a better performance than Genetic Algorithm (GA) on flexible job-shop scheduling problem under processing time uncertainty and the reactive scheduling algorithm can handle the equipment breakdown with little robustness lost.


Sign in / Sign up

Export Citation Format

Share Document