Robust Scheduling Problems
In Example 7 of Chapter 2 we introduced the notion of robust scheduling. Schedulers confronted with significant processing time uncertainty often discover that a schedule which is optimal with respect to a deterministic or stochastic scheduling model yields quite poor performance when evaluated relative to the actual processing times. In these environments, the notion of schedule robustness, i.e., determining the schedule with the best worst-case performance compared to the corresponding optimal solution over all potential realizations of job processing times, is a more appropriate guide to schedule selection. The benefits of robust decision making in a scheduling context have been clearly illustrated through an example in Chapter 1 (Section 1.1 and Section 1.2).
KeywordsProcessing Time Schedule Problem Optimal Makespan Processing Time Interval Dominance Property
Unable to display preview. Download preview PDF.
- ; Daniels, R.L. and P. Kouvelis (1992), “Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production,” Working paper, Fuqua School of Business, Duke University.Google Scholar
- Kouvelis, P., R.L. Daniels and G. Vairaktarakis (1996), “Robust Scheduling of a Two-Machine Flow Shop with Uncertain Processing Times,” Working Paper, Fuqua School of Business, Duke University (to appear in Naval Research Logistics). Google Scholar
- Yu, G. (1993), “On the Robust One-Machine Scheduling Problem,” Working Paper, Department of MSIS, Graduate School of Business, The University of Texas at Austin.Google Scholar