抄録
This study deals with a so called match-up scheduling which aims at enhancing the stability of the existing schedule by allocating time buffers in advance onto the initial predictive schedule. The time buffers are expected to absorb schedule delays which might be incurred by sources of uncertainties during the schedule execution. Absorption of such delays will "catch up" the planned one at some point in a future. In this paper, we propose a new method of match-up scheduling for dynamic job shop environments. Some computational experiments demonstrate the capability of the proposed method as a robust scheduling method.
