On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’ processing times are perturbed and therefore turn out to be longer (or shorter) than declared. We focus on online scheduling with perturbations occurring at any time, such as in railway systems when trains are late. For a variety of conditions on the severity of perturbations, we present bounds on the worst case ratio of two makespans. For the first makespan, we let the online algorithm assign jobs to machines, based on the non-perturbed processing times. We compute the makespan by replacing each job’s processing time with its perturbed version while still sticking to the computed assignment. The second is an optimal offline solution for the perturbed processing times. The deviation of this ratio from the competitive ratio of the online algorithm tells us about the “price of perturbations”. We analyze this setting for Graham’s algorithm, and among other bounds show a competitive ratio of 2 for perturbations decreasing the processing time of a job arbitrarily, and a competitive ratio of less than 2.5 for perturbations doubling the processing time of a job. We complement these results by providing lower bounds for any online algorithm in this setting. Finally, we propose a risk-aware online algorithm tailored for the possible bounded increase of the processing time of one job, and we show that this algorithm can be worse than Graham’s algorithm in some cases.
KeywordsRobustness Online Scheduling Graham’s Algorithm Perturbation
Unable to display preview. Download preview PDF.
- Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms and applications. New York: Prentice Hall. Google Scholar
- Chvátal, V. (1983). Linear programming. New York: Freeman. Google Scholar
- Graham, R. L. (1966). Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45(9), 1563–1581. Google Scholar
- Kouvelis, P., & Yu, G. (1997). Robust discrete optimization and its applications. Dordrecht: Kluwer Academic. Google Scholar
- Mauroy, G., Wardi, Y., & Proth, J. M. (1997). Sensitivity analysis of machine schedules with multi-priority job classes. In Proceedings of the 36th IEEE conference on decision and control (Vol. 5067, pp. 686–691). Google Scholar
- Pinedo, M. (2002). Scheduling: Theory, algorithms, and systems. New York: Prentice Hall. Google Scholar
- Schäfer, G. (2004). Worst case instances are fragile. Average case and smoothed competitive analysis of algorithms. Ph.D. thesis, Universität des Saarlandes, April 2004. Google Scholar
- Sgall, J. (1998). On-line scheduling. In A. Fiat & G. J. Woeginger (Eds.), Lecture notes in computer science : Vol. 1442. Online algorithms: The state of the art (pp. 196–231). Berlin: Springer. Google Scholar