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 bounda...

Full description

Bibliographic Details
Main Authors: Hankun Zhang, Borut Buchmeister, Xueyan Li, Robert Ojstersek
Format: Article
Language:English
Published: MDPI AG 2021-04-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/9/8/909