遅延可能時間を用いたロバストスケジューリングの一手法

抄録

Since former studies about schedule problems have focused on suitability and efficiency of schedules under static environment, they can not be adapted to dynamic environment under which unpredictable delay of operations occurs.In order to cope with this problem, we propose a new robust scheduling method with "Acceptable Delay Time(ADT)". An acceptable delay time of an operation means the time within which if the time of delay of the operation is, all jobs finish until their due dates. We introduce ADT in order to finish as many jobs within their due dates as possible when delay of operations occurs. We try to generate robuster schedules by adapting the scheduling method based on the order constraint and iteratively improving an initial schedule with an evaluation function using ADT.With the experiment of the job shop scheduling problem with delay of operations, we examine robustness of the schedule improved with three different kinds of evaluation functions using ADT and compare them with one using the length of the schedule. As a result of the experiment, we show that as schedules have the longer average of ADT, more unfinished jobs within their due dates decrease.