Dynamic Scheduling Using the Mixture of a Genetic Algorithm and a Priority Rule

Abstract

We have already proposed a dynamic job shop scheduling method using the mixture of a genetic algorithm and a priority rule. So far, we found the due date allowance plays an important role in the method. However, in the previous method, the due date allowance was not included explicitly in the performance function optimized periodically. In this report, we examine the effect of the due date allowance by including it into the performance function explicitly, and show its effect using numerical experiments.