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

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.

[1]  Mostafa Zandieh,et al.  A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms , 2016, Comput. Oper. Res..

[2]  Jian Xiong,et al.  Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns , 2013 .

[3]  Min Dai,et al.  Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization , 2016, Comput. Ind..

[4]  Kinza Nadia Mouss,et al.  A new genetic algorithm for flexible job-shop scheduling problems , 2015 .

[5]  Quan-Ke Pan,et al.  Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems , 2011 .

[6]  Tarek Y. ElMekkawy,et al.  Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm , 2011 .

[7]  Mostafa Zandieh,et al.  An efficient knowledge-based algorithm for the flexible job shop scheduling problem , 2012, Knowl. Based Syst..

[8]  Henry Y. K. Lau,et al.  An AIS-based hybrid algorithm with PDRs for multi-objective dynamic online job shop scheduling problem , 2013, Appl. Soft Comput..

[9]  Xin Yao,et al.  Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems , 2015, Inf. Sci..

[10]  Ferdinando Pezzella,et al.  An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem , 2010, Eur. J. Oper. Res..

[11]  P. Senthil Kumar,et al.  Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling , 2014, Int. J. Comput. Intell. Syst..

[12]  Fariborz Jolai,et al.  Mathematical modeling and heuristic approaches to flexible job shop scheduling problems , 2007, J. Intell. Manuf..

[13]  Xinyu Li,et al.  A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem , 2013 .

[14]  Shahaboddin Shamshirband,et al.  Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises , 2015, Ann. Oper. Res..

[15]  Guoji Zhang,et al.  A Hybrid Algorithm for Flexible Job-Shop Scheduling Problem , 2011 .

[16]  Donya Rahmani,et al.  A stable reactive approach in dynamic flexible flow shop scheduling with unexpected disruptions: A case study , 2016, Comput. Ind. Eng..

[17]  Mostafa Zandieh,et al.  Multi-objective scheduling of dynamic job shop using variable neighborhood search , 2010, Expert Syst. Appl..

[18]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[19]  Liang Gao,et al.  A Novel Variable Neighborhood Genetic Algorithm for Multi-Objective Flexible Job-Shop Scheduling Problems , 2010 .

[20]  Fuqing Zhao,et al.  A Dynamic Rescheduling Model with Multi-Agent System and Its Solution Method , 2012 .

[21]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[22]  Mostafa Zandieh,et al.  Developing two multi-objective evolutionary algorithms for the multi-objective flexible job shop scheduling problem , 2012, The International Journal of Advanced Manufacturing Technology.

[23]  Shengyao Wang,et al.  An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .

[24]  Andrea Rossi,et al.  Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships , 2014 .

[25]  Xinyu Li,et al.  An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem , 2016 .

[26]  Yi Liu,et al.  A fast estimation of distribution algorithm for dynamic fuzzy flexible job-shop scheduling problem , 2015, Comput. Ind. Eng..

[27]  G. Vilcot,et al.  A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem , 2011 .

[28]  Osman Kulak,et al.  Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem , 2016, Comput. Ind. Eng..

[29]  Alireza Fallahi,et al.  Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability , 2010 .

[30]  Marie-Ange Manier,et al.  A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times , 2012, Comput. Oper. Res..

[31]  Arit Thammano,et al.  Modified Genetic Algorithm for Flexible Job-Shop Scheduling Problems , 2012, Complex Adaptive Systems.

[32]  Yugeng Xi,et al.  Robust and stable scheduling of a single machine with random machine breakdowns , 2006 .

[33]  Liang Gao,et al.  Reactive scheduling in a job shop where jobs arrive over time , 2013, Comput. Ind. Eng..

[34]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[35]  Richard Romanowski,et al.  Multicontextual dispatching rules for job shops with dynamic job arrival , 2013 .