2002 Volume 15 Issue 7 Pages 327-335
Reactive scheduling approach is considered effective in a manufacturing system, which undergoes various types of delays due to disruption such as machine breakdowns, urgent jobs and so on. This is because it aims to reduce delays of the schedule by revising it partially for some jobs. This paper deals with the problem in what situation we should conduct schedule revision in reactive scheduling in order to obtain an efficient revised schedule. In this paper, we focus on the number of delayed tasks based on the concept ofmatch-upto demonstrate the existence of a suitable number of delayed tasks by computational simulation which can be a criterion to determine the schedule revision timing. An optimal policy to determine the timing of schedule revision is also suggested.