A new when-to-schedule policy in online scheduling based on cumulative task delays

Abstract This paper proposes a new when-to-schedule policy in online scheduling, which considers timing of rescheduling based on the concept of a control limit policy and rolling schedules. Under the proposed policy, rescheduling is carried out based on a cumulative delay which can be a measure to determine suitable timing of rescheduling. Some computational experiments demonstrate the effectiveness of the proposed policy by applying it to single-machine dynamic scheduling with sequence-dependent setup times and urgent jobs, where total setups are minimized as well as rescheduling frequency. It is also demonstrated that the proposed policy can outperform typical rescheduling policies.

[1]  Nabil R. Adam,et al.  Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules , 1980 .

[2]  Ihsan Sabuncuoglu,et al.  Reactive scheduling in a dynamic and stochastic FMS environment , 2003 .

[3]  Jeffrey W. Herrmann,et al.  Analytical models to predict the performance of a single-machine system under periodic and event-driven rescheduling strategies , 2000 .

[4]  Albert Lee,et al.  Evaluation of ordering strategies for constraint satisfaction reactive scheduling , 1998, Decis. Support Syst..

[5]  Bart L. MacCarthy,et al.  Statistical process control for monitoring scheduling performance—addressing the problem of correlated data , 2001, J. Oper. Res. Soc..

[6]  Stephen F. Smith,et al.  Reactive Scheduling Systems , 1995 .

[7]  P. Brunn,et al.  Workshop scheduling using practical (inaccurate) data Part 1: The performance of heuristic scheduling rules in a dynamic job shop environment using a rolling time horizon approach , 1999 .

[8]  C. Derman.  DENUMERABLE STATE MARKOVIAN DECISION PROCESSES: AVERAGE COST CRITERION. , 1966 .

[9]  Elizabeth Szelke,et al.  Artificial Intelligence in Reactive Scheduling , 1995, IFIP Advances in Information and Communication Technology.

[10]  Yugeng Xi,et al.  A rolling horizon job shop rescheduling strategy in the dynamic environment , 1997 .

[11]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[12]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[13]  Reha Uzsoy,et al.  Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. , 1995 .

[14]  V. V. S. Sarma,et al.  Knowledge-Based Approaches to Scheduling Problems: A Survey , 1991, IEEE Trans. Knowl. Data Eng..

[15]  Kazuo Miyashita,et al.  CABINS: A Framework of Knowledge Acquisition and Iterative Revision for Schedule Improvement and Reactive Repair , 1995, Artif. Intell..

[16]  Donald E. Brown,et al.  Intelligent Scheduling Systems , 1995 .

[17]  K. R. Baker,et al.  An Analytic Framework for Evaluating Rolling Schedules , 1979 .

[18]  Monte Zweben,et al.  Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..

[19]  A. G. Lockett,et al.  Job shop scheduling heuristics and frequency of scheduling , 1982 .

[20]  Reha Uzsoy,et al.  Analysis of periodic and event-driven rescheduling policies in dynamic shops , 1992 .

[21]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..