ROBUSTNESS MEASURES AND ROBUST SCHEDULING FOR JOB SHOPS
- 1 September 1994
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 26 (5) , 32-43
- https://doi.org/10.1080/07408179408966626
Abstract
A robust schedule is defined as a schedule that is insensitive to unforeseen shop floor disturbances given an assumed control policy. In this paper, a definition of schedule robustness is developed which comprises two components: post-disturbance make-span and post-disturbance makespan variability. We have developed robustness measures and robust scheduling methods for the case where a “right-shift” control policy is used. On occurrence of a disruption, the right-shift policy maintains the scheduling sequence while delaying the unfinished jobs as much as necessary to accommodate the disruption. An exact measure of schedule robustness is derived for the case in which only a single disruption occurs within the planning horizon. A surrogate measure is developed for the more complex case in which multiple disruptions may occur. This surrogate measure is then embedded in a genetic algorithm to generate robust schedules for job-shops. Experimental results show that robust schedules significantly outperform schedules based on makespan alone.Keywords
This publication has 16 references indexed in Scilit:
- Matchup Scheduling with Multiple Resources, Release Dates and DisruptionsOperations Research, 1991
- Semi-Markov models for single-machine stochastic scheduling problemsInternational Journal of Systems Science, 1985
- Scheduling/rescheduling in the manufacturing operating system environment†International Journal of Production Research, 1985
- Scheduling stochastic jobs on a single machine subject to breakdownsNaval Research Logistics Quarterly, 1984
- Stochastic Scheduling with Release Dates and Due DatesOperations Research, 1983
- On nonpreemptive strategies in stochastic schedulingNaval Research Logistics Quarterly, 1981
- Scheduling Jobs Subject to Nonhomogeneous Poisson ShocksManagement Science, 1980
- On Bayesian models in stochastic schedulingJournal of Applied Probability, 1977
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969
- Algorithms for Solving Production-Scheduling ProblemsOperations Research, 1960