抄録
This paper deals with the optimization of job shop scheduling. The optimal schedule for minimizing a regular objective function such as tardiness of jobs exists in the set of active schedules. It is well known that Giffler and Thompson' algorithm can generate active schedules for job shop scheduling. However, the algorithm does not assign operations of jobs according to time progress in terms of their start times. This paper proposes a new algorithm for generating active schedules in which operations of jobs are assigned according to time progress. Numerical experiments are carried out to show the effectiveness of the proposed algorithm.
