Multi-objective job shop rescheduling with evolutionary algorithm

被引:0
作者
Hao X.C. [1 ]
Gen M. [1 ]
机构
[1] IPS, Waseda University, Wakamatsu-ku, Kitakyushu 808-0135, 2-7, Hibikino
关键词
Evolutionary algorithm; Interactive adaptive-weight fitness assignment; Job shop rescheduling; Multi-objective optimization;
D O I
10.1541/ieejeiss.131.674
中图分类号
学科分类号
摘要
In current manufacturing systems, production processes and management are involved in many unexpected events and new requirements emerging constantly. This dynamic environment implies that operation rescheduling is usually indispensable. A wide variety of procedures and heuristics has been developed to improve the quality of rescheduling. However, most proposed approaches are derived usually with respect to simplified assumptions. As a consequence, these approaches might be inconsistent with the actual requirements in a real production environment, i.e., they are often unsuitable and inflexible to respond efficiently to the frequent changes. In this paper, a multi-objective job shop rescheduling problem (moJSRP) is formulated to improve the practical application of rescheduling. To solve the moJSRP model, an evolutionary algorithm is designed, in which a random key-based representation and interactive adaptive-weight (i-awEA) fitness assignment are embedded. To verify the effectiveness, the proposed algorithm has been compared with other apporaches and benchmarks on the robustness of moJRP optimziation. The comparison results show that iAWGA-A is better than weighted fitness method in terms of effectiveness and stability. Simlarly, iAWGA-A also outperforms other well stability approachessuch as non-dominated sorting genetic algorithm (NSGA-II) and strength Pareto evolutionary algorithm2 (SPEA2). © 2011 The Institute of Electrical Engineers of Japan.
引用
收藏
页码:674 / 681
页数:7
相关论文
共 24 条
[1]  
Gen M., Cheng R., Lin L., Network Models and Optimization: Multiobjective Genetic Algorithm Approach, (2008)
[2]  
Vieira G.E., Herrmann J.W., Lin E., Rescheduling manufacturing systems: A framework of strategies, policies, and methods, Journal of Scheduling, 6, 1, pp. 39-62, (2003)
[3]  
Dominic P.D.D., Kaliyamoorthy S., Kumar M.S., Efficient dispatching rules for dynamic job shop scheduling, The International Journal of Advanced Manufacturing Technology, 24, 1, pp. 70-75, (2004)
[4]  
Sabuncuoglu I., Kizilisik O.B., Reactive scheduling in a dynamic and stochastic FMS environment, International Journal of Production Research, 41, 17, pp. 4211-4231, (2003)
[5]  
Sha D.Y., Liu C.-H., Using data mining for due date assignment in a dynamic job shop environment, International Journal of Advanced Manufacturing Technology, 25, 11-12, pp. 1164-1174, (2005)
[6]  
Vinod V., Sridharan R., Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study, Robotics and Computer-Integrated Manufacturing, 24, 3, pp. 435-449, (2008)
[7]  
Dahal K., Tan K.C., Cowling P.I., Evolutionary Scheduling, (2007)
[8]  
Kempf K.G., Intelligently scheduling semiconductor wafer fabrication, Intelligent Scheduling, pp. 517-544, (1994)
[9]  
Rangsaritratsamee R., Ferrell W.G., Dynamic rescheduling that simultaneously considers efficiency and stability, Computers & Industrial Engineering, 46, 1, pp. 1-15, (2004)
[10]  
Adibi M.A., Zandieh M., Amiri M., Multi-objective scheduling of dynamic job shop using variable neighborhood search, Expert Systems with Applications, 37, 1, pp. 282-287, (2010)