An extended horizon scheduling algorithm for the job-shop problem

Abstract

A real-time scheduling algorithm for a flexible manufacturing system environment is described. This algorithm uses a schedule space search which is characterized by a heuristic-oriented approach based on simulation. The algorithm can be seen as a look-ahead dispatching rule, because the simulation-based search gives a forecast of how good a schedule can be, before choosing the best one. The algorithm structure is based on the fact that a minimal set of parts can be defined, which is a common divisor of the total number of parts.<>