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

Abstract

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.

A Hybrid Grey Wolf Optimizer for Process Planning Optimization with Precedence Constraints

“…Similar values for the HGWO and the PSO are obtained for the prismatic part 2. Although some authors suggest less amount of time to be reasonable for large-sized NP-hard problems [ 50 ], we may argue that approximately 1 to 1.5 min of the running time is a reasonably well amount of time needed to solve different instances of an NP-hard problem such as the PPO. GA and GWO as traditional algorithms obviously show the lowest computational times in all studies, since the modified and hybrid algorithms require more time to perform additional operations.…”

‘Mover’ a Centralized Job Scheduling and Rapid Routing Solution

“…Every algorithm have different parameter such as time, cost, machine availability, energy savings etc on the basis of which the system do job allocations that yields minimum idle time of machine and maximize pro ts (Rossit et The recent studies yield the integration of scheduling and routing algorithms with AGV, making it smarter (Yang et al 2018;Riazi and Lennartson 2021). The dynamic nature of job-shop scheduling is also addressed using improved heuristic kalman algorithm i.e., the mixture of genetic and huristic Kalman, the ndings yield that the improved algorithm is much effective in addressing the dynamic job-shop problem with a benchmark score of 9 out of 15 (Zhang et al 2021). There are various studies that simulated the routing and scheduling capabilities of AGV and their ndings suggested improved production e ciency (Zhao et al 2020).…”

A Track-Based Conference Scheduling Problem

“…We classify planning problems based on whether the main focus of the scheduling is a set of tasks or events. Tasks are activities that must share a set of locations and resources in a planning horizon, often satisfying a set of precedence rules derived from a goal associated with their completion [2,3]. For example, some planning problems can be related to scheduling a production process comprising several tasks or rescheduling the production in a dynamic environment considering setup time and limited resources (machines and setup workers) [4].…”