効率的なアクティブスケジュール探索法

抄録

This paper proposes an efficient optimization method for job shop scheduling. Optimum schedules with regard to regular objective functions such as tardiness of jobs exist in the set of active schedules. Active schedules may insert idle times when machines became idle and there are waiting jobs. This decision of inserting idle times is difficult when searching optimum schedules. In the proposed method, the job which arrives a machine earlier is set to have a higher priority value using a weight value to avoid making the machine idle long time. Furthermore, when an idle time is inserted, the time length is considered when calculating priority values of jobs. Numerical experiments show the effectiveness of the proposed method by comparing it with the method using a look-ahead parameter.