2202 Time Buffer Based Match-up Strategy for Parallel Machine Scheduling

Abstract

This paper deals with a new reactive scheduling strategy, which is referred to as match-up strategy, with a buffered predictive schedule aiming at reducing overreaction to disruptions which occur during the schedule execution. Buffers allocated on the predictive schedule over time play a role of absorption of schedule delays, by which it is expected to control frequent schedule modification. Some computational experiments demonstrate the applicablity of the proposed strategy under parallel machine environment.