Abstract
There is no single dispatching rule which performs dominantly better than any other rules for the mean tardiness job shop scheduling problem since the perfomance of dispatching rules depends on the conditions of each problem. This paper suggests an approach to generate new robust dispatching rules.First, this approach learns from successful examples by applying customary dispatching rules to obtain good conflict resolution rules.Then, an inductive procedure is applied to generalize this set of accumulated rules.Applying this approach to the static job shop scheduling problem, a novel dispatching rule was generated and demonstrated to have better performance than other dispatching rules for a wide range of due date tightness.
