A Variable Interval Rescheduling Strategy for Dynamic Flexible Job Shop Scheduling Problem by Improved Genetic Algorithm

• Published in: Journal of advanced transportation Vol. 2017; no. 2017; pp. 1 - 12
• Main Authors: Wang, Lei, Cai, Jingcao, Luo, Chaomin
• Format: Journal Article
• Language: English
• Published: Cairo, Egypt Hindawi Publishing Corporation 01.01.2017; Hindawi; Hindawi Limited; Wiley
• Subjects: Algorithms; Breakdowns; Genetic algorithms; Job shop scheduling; Job shops; Methods; Mutation; Optimization; Population; Production scheduling; Rescheduling; Scheduling; Scheduling (Management); Stochasticity; Strategy; Transportation
• ISSN: 0197-6729; 2042-3195
• DOI: 10.1155/2017/1527858

In real-world manufacturing systems, production scheduling systems are often implemented under random or dynamic events like machine failure, unexpected processing times, stochastic arrival of the urgent orders, cancellation of the orders, and so on. These dynamic events will lead the initial scheduling scheme to be nonoptimal and/or infeasible. Hence, appropriate dynamic rescheduling approaches are needed to overcome the dynamic events. In this paper, we propose a dynamic rescheduling method based on variable interval rescheduling strategy (VIRS) to deal with the dynamic flexible job shop scheduling problem considering machine failure, urgent job arrival, and job damage as disruptions. On the other hand, an improved genetic algorithm (GA) is proposed for minimizing makespan. In our improved GA, a mix of random initialization population by combining initialization machine and initialization operation with random initialization is designed for generating high-quality initial population. In addition, the elitist strategy (ES) and improved population diversity strategy (IPDS) are used to avoid falling into the local optimal solution. Experimental results for static and several dynamic events in the FJSP show that our method is feasible and effective.