Abstract
Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, jobs are consecutively added and/or deleted and the goal is to always maintain a (close to) optimal assignment of jobs to machines. The reassignment of a job induces a cost proportional to its size and the total cost for reassigning jobs must preferably be bounded by a constant r times the total size of added or deleted jobs. Our main result is that, for any ε> 0, one can always maintain a (1 + ε)-competitive solution for some constant reassignment factor r(ε). For the minimum makespan problem this is the first improvement of the (2 + ε)-competitive algorithm with constant reassignment factor published in 1996 by Andrews, Goemans, and Zhang.
Supported by Berlin Mathematical School and by DFG research center Matheon.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albers, S.: Online algorithms: a survey. Mathematical Programming 97, 3–26 (2003)
Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling 1, 55–66 (1998)
Andrews, M., Goemans, M., Zhang, L.: Improved bounds for on-line load balancing. Algorithmica 23, 278–301 (1999)
Azar, Y.: On-line load balancing. In: Fiat, A., Woeginger, G.J. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1442, pp. 178–195. Springer, Heidelberg (1998)
Azar, Y., Epstein, L.: On-line machine covering. Journal of Scheduling 1, 67–77 (1998)
Chen, B., van Vliet, A., Woeginger, G.J.: Lower bounds for randomized online scheduling. Information Processing Letters 51, 219–222 (1994)
Epstein, L., Levin, A.: A robust APTAS for the classical bin packing problem. Mathematical Programming 119, 33–49 (2009)
Fleischer, R., Wahl, M.: Online scheduling revisited. Journal of Scheduling 3, 343–353 (2000)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM 34, 144–162 (1987)
Rudin III, J.F., Chandrasekaran, R.: Improved bounds for the online scheduling problem. SIAM Journal on Computing 32, 717–735 (2003)
Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. Mathematics of Operations Research 34, 481–498 (2009)
Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Information Processing Letters 63, 51–55 (1997)
Sgall, J.: On-line scheduling — a survey. In: Fiat, A., Woeginger, G.J. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1442, pp. 196–231. Springer, Heidelberg (1998)
Skutella, M., Verschae, J.: A robust PTAS for machine covering and packing. Technical Report 011-2010, Technische Universität Berlin (2010), http://www.math.tu-berlin.de/coga/publications/techreports/2010/Report-011-2010.xhtml
Westbrook, J.: Load balancing for response time. Journal of Algorithms 35, 1–16 (2000)
Woeginger, G.J.: A polynomial-time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters 20, 149–154 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skutella, M., Verschae, J. (2010). A Robust PTAS for Machine Covering and Packing. In: de Berg, M., Meyer, U. (eds) Algorithms – ESA 2010. ESA 2010. Lecture Notes in Computer Science, vol 6346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15775-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-15775-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15774-5
Online ISBN: 978-3-642-15775-2
eBook Packages: Computer ScienceComputer Science (R0)