Analysis of periodic and event-driven rescheduling policies in dynamic shops
- 1 May 1992
- journal article
- research article
- Published by Taylor & Francis Ltd in International Journal of Computer Integrated Manufacturing
- Vol. 5 (3), 153-163
- https://doi.org/10.1080/09511929208944524
Abstract
We address the problem of rescheduling production systems in the face of dynamic job arrivals. Using simple single-and parallel-machine models to gain insight, we provide worst-case and computational analyses of periodic and event-driven rescheduling policies. Our results indicate that event-driven policies can obtain high-quality schedules with less rescheduling than continuous rescheduling policies. We also show that if structure in the job arrival process is exploited very effective periodic rescheduling policies can be designed.Keywords
This publication has 24 references indexed in Scilit:
- Matchup Scheduling with Multiple Resources, Release Dates and DisruptionsOperations Research, 1991
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- Single machine flow-time scheduling with a single breakdownActa Informatica, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Scheduling jobs with release dates and tails on identical machines to minimize the makespanEuropean Journal of Operational Research, 1987
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- A state-of-the-art survey of dispatching rules for manufacturing job shop operationsInternational Journal of Production Research, 1982
- A Comparison of Due-Date Selection RulesA I I E Transactions, 1981
- Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling RulesManagement Science, 1980
- The dynamic aspects of a production scheduling problemInternational Journal of Production Research, 1979