Advanced Metaheuristic Method for Decision-Making in a Dynamic Job Shop Scheduling Environment

As a well-known NP-hard problem, the dynamic job shop scheduling problem has significant practical value, so this paper proposes an Improved Heuristic Kalman Algorithm to solve this problem. In Improved Heuristic Kalman Algorithm, the cellular neighbor network is introduced, together with the boundary handling function, and the best position of each individual is recorded for constructing the cellular neighbor network. The encoding method is introduced based on the relative position index so that the Improved Heuristic Kalman Algorithm can be applied to solve the dynamic job shop scheduling problem. Solving the benchmark example of dynamic job shop scheduling problem and comparing it with the original Heuristic Kalman Algorithm and Genetic Algorithm-Mixed, the results show that Improved Heuristic Kalman Algorithm is effective for solving the dynamic job shop scheduling problem. The convergence rate of the Improved Heuristic Kalman Algorithm is reduced significantly, which is beneficial to avoid the algorithm from falling into the local optimum. For all 15 benchmark instances, Improved Heuristic Kalman Algorithm and Heuristic Kalman Algorithm have obtained the best solution obtained by Genetic Algorithm-Mixed. Moreover, for 9 out of 15 benchmark instances, they achieved significantly better solutions than Genetic Algorithm-Mixed. They have better robustness and reasonable running time (less than 30 s even for large size problems), which means that they are very suitable for solving the dynamic job shop scheduling problem. According to the dynamic job shop scheduling problem applicability, the integration-communication protocol was presented, which enables the transfer and use of the Improved Heuristic Kalman Algorithm optimization results in the conventional Simio simulation environment. The results of the integration-communication protocol proved the numerical and graphical matching of the optimization results and, thus, the correctness of the data transfer, ensuring high-level usability of the decision-making method in a real-world environment.

[1]  M. R. Yu,et al.  Dynamic integration of process planning and scheduling using a discrete particle swarm optimization algorithm , 2018, Advances in Production Engineering & Management.

[2]  Shifeng Liu,et al.  Use of a Simulation Environment and Metaheuristic Algorithm for Human Resource Management in a Cyber-Physical System , 2019, Springer Series in Advanced Manufacturing.

[3]  Ayse Tugba Dosdogru,et al.  Process plan and part routing optimization in a dynamic flexible job shop scheduling environment: an optimization via simulation approach , 2012, Neural Computing and Applications.

[4]  Meng Zhang,et al.  Effective Heuristic Algorithms Solving the Jobshop Scheduling Problem with Release Dates , 2020, Mathematics.

[5]  Burak Birgören,et al.  A Decision Support System for Dynamic Job-Shop Scheduling Using Real-Time Data with Simulation , 2019, Mathematics.

[6]  Magdalene Marinaki,et al.  A Hybrid Particle Swarm Optimization Algorithm for the Open Vehicle Routing Problem , 2012, ANTS.

[7]  Gongfa Li,et al.  A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints , 2017, Eur. J. Oper. Res..

[8]  Gang Chen,et al.  An investigation of ensemble combination schemes for genetic programming based hyper-heuristic approaches to dynamic job shop scheduling , 2018, Appl. Soft Comput..

[9]  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..

[10]  Liu Shi-feng,et al.  Improved Heuristic Kalman Algorithm for Solving Multi-Objective Flexible Job Shop Scheduling Problem , 2018 .

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

[12]  Liang Gao,et al.  A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates , 2013, J. Intell. Manuf..

[13]  Xue-yan Li,et al.  Dynamic route and departure time choice model based on self-adaptive reference point and reinforcement learning , 2018, Physica A: Statistical Mechanics and its Applications.

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

[15]  Jamal Shahrabi,et al.  A reinforcement learning approach to parameter estimation in dynamic job shop scheduling , 2017, Comput. Ind. Eng..

[16]  Patrick Lyonnet,et al.  A new heuristic approach for non-convex optimization problems , 2010, Inf. Sci..

[17]  Y. Q. Zhang,et al.  A Discrete Job-Shop Scheduling Algorithm Based on Improved Genetic Algorithm , 2020, International Journal of Simulation Modelling.

[18]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[19]  Patrick Lyonnet,et al.  A Kalman Optimization Approach for Solving Some Industrial Electronics Problems , 2012, IEEE Transactions on Industrial Electronics.

[20]  Saeed Mansour,et al.  Dynamic flexible job shop scheduling with alternative process plans: an agent-based approach , 2011 .

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

[22]  R. Ojstersek,et al.  A new method for mathematical and simulation modelling interactivity: A case study in flexible job shop scheduling , 2019 .

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

[24]  V. Vinod,et al.  Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system , 2011 .