Event-driven dynamic Job-shop scheduling method with strong process constraints

Abstract

In the actual production environment, there are many uncertainties that need to be handled. Since the occurrence time and frequency of dynamic events cannot be predicted, frequent global scheduling calculation will cause waste of time and resources. Therefore, facing the challenge of job shop scheduling problem in dynamic scenarios, this paper studied the dynamic event-driven job shop scheduling problem with complex process constraints, and proposed an improved NSGAII algorithm. At the end of this paper, the designed dynamic scheduling method is applied to a variety of benchmarks through experiments to verify the effectiveness of the proposed method in solving the job shop scheduling problem in a dynamic environment.