Abstract
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 upper bounds on the worst case ratio of two makespans. For the first makespan, we let Graham’s 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 Graham’s competitive ratio (of slightly less than 2) tells us about the “price of perturbations”. For instance, we 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.
This work was partially supported by the Future and Emerging Technologies Unit of EC (IST priority - 6th FP), under contract no. FP6-021235-2 (project ARRIVAL).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)
Albers, S.: On randomized online scheduling. In: STOC 2002. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 134–143. ACM Press, New York (2002)
Ben-Tal, A., Nemirovski, A.: Robust optimization – methodology and applications. Mathematical Programming 92(3), 453–480 (2002)
Chvátal, V.: Linear Programming. Freeman, San Francisco (1983)
Fleischer, R., Wahl, M.: Online scheduling revisited. Journal of Scheduling, special issue on approximation algorithms for scheduling algorithms (part 2) 3(6), 343–353 (2000)
Graham, R.L.: Bounds for certain multiprocessor anomalies. Bell System Techical Journal 45(9), 1563–1581 (1966)
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17(2), 416–429 (1969)
Hall, N.G., Posner, M.E.: Sensitivity analysis for scheduling problems. Journal of Scheduling 7, 49–83 (2004)
Kasperski, A., Zieliński, P.: An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97(5), 177–180 (2006)
Kolen, A., Kan, A., van Hoesel, C., Wagelmans, A.: Sensitivity analysis of list scheduling heuristics. Discrete Applied Mathematics 55, 145–162 (1994)
Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Dordrecht (1997)
Möhring, R.H., Schulz, A.S., Uetz, M.: Approximation in stochastic scheduling: the power of LP-based priority policies. Journal of the ACM 46(6), 924–942 (1999)
Montemanni, R., Gambardella, L.M.: An exact algorithm for the robust shortest path problem with interval data. Computers & Operations Research 31, 1667–1680 (2004)
Moukrim, A., Sanlaville, E., Guinan, F.: Parallel machine scheduling with uncertain communication delays. RAIRO Oper. Res. 37, 1–16 (2003)
Penz, B., Rapine, C., Trystram, D.: Sensitivity analysis of scheduling algorithms. European Journal of Operational Research 134, 606–615 (2001)
Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs (2002)
Sanlaville, E.: Sensitivity bounds for machine scheduling with uncertain communication delays. Journal of Scheduling 8(5), 461–473 (2005)
Scharbrodt, M., Schickinger, T., Steger, A.: A new average case analysis for completion time scheduling. Journal of the ACM 53(1), 121–146 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gatto, M., Widmayer, P. (2007). On the Robustness of Graham’s Algorithm for Online Scheduling. In: Dehne, F., Sack, JR., Zeh, N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73951-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-73951-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73948-7
Online ISBN: 978-3-540-73951-7
eBook Packages: Computer ScienceComputer Science (R0)