A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem

2013 ◽  
Vol 51 (12) ◽  
pp. 3516-3531 ◽  
Author(s):  
Liping Zhang ◽  
Liang Gao ◽  
Xinyu Li
2012 ◽  
Vol 198-199 ◽  
pp. 1413-1416 ◽  
Author(s):  
Cun Liang Yan ◽  
Wei Feng Shi ◽  
Ze Ming Zou

In real production processing, job shop scheduling problem (JSP) is often express as dynamic scheduling problem. In this article a hybrid genetic algorithm and handling strategies are used for real job shop scheduling problem. It gives the scheduling result with the appropriate handling strategies to the stochastic events such as equipment breakdown and urgent orders. The data of Shanghai Shen Mo Die & Mold Manufacturing Co., Ltd (ShenMo) is used for the application of dynamic scheduling simulation, and the results of which show that the proposed method can satisfactorily solve the stochastic events of scheduling.


Sign in / Sign up

Export Citation Format

Share Document