Abstract
We consider the problem of assigning jobs to m identical machines. The load of a machine is the sum of the weights of jobs assigned to it. The goal is to minimize the norm of the resulting load vector. It is known that for any fixed norm there is a PTAS. On the other hand, it is also known that there is no single assignment which is optimal for all norms. We show that there exists one assignment which simultaneously guarantees a 1.388-approximation of the optimal assignments for all norms. This improves the 1.5 approximation given by Chandra and Wong in 1975.
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
Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling. In: Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, pp. 493–500 (1997)
Awerbuch, B., Azar, Y., Grove, E., Kao, M., Krishnan, P., Vitter, J.: Load balancing in the lp norm. In: newblock In Proc. 36th FOCS, pp. 383–391 (1995)
Azar, Y., Epstein, L., Richter, Y., Woeginger, G.J.: All-norm approximation algorithms. In: Proc. of 8th SWAT, pp. 288–297 (2002)
Chandra, A.K., Wong, C.K.: Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal on Computing 4(3), 249–263 (1975)
Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. In: Proc. 7th Annual European Symposium on Algorithms, pp. 151–162 (1999)
Goel, A., Meyerson, A.: Simultaneous optimization via approximate majorization for concave profits or convex costs (2003) (manuscript)
Goel, A., Meyerson, A., Plotkin, S.: Approximate majorization and fair online load balancing. In: Proc. 12nd ACM-SIAM Symp. on Discrete Algorithms, pp. 384–390 (2001)
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 416–429 (1969)
Hardy, G.H., Littlewood, J.E., Polya, G.: Some simple inequalities satisfied by convex functions. Messenger Math. 58, 145–152 (1929)
Hochbaum, D., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing 17(3), 539–551 (1988)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J. of the ACM 34(1), 144–162 (1987)
Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. Journal of the Association for Computing Machinery 23, 317–327 (1976)
Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Prog. 46, 259–271 (1990)
Shmoys, D., Tardos, E.: An approximation algorithm for the generalized assignment problem. Mathematical Programming A 62, 461–474 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azar, Y., Taub, S. (2004). All-Norm Approximation for Scheduling on Identical Machines. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive