Abstract
In this paper we consider the temporary tasks assignment problem. In this problem, there are m parallel machines and n independent jobs. Each job has an arrival time, a departure time and some weight. Each job should be assigned to one machine. The load on a machine at a certain time is the sum of the weights of jobs assigned to it at that time. The objective is to find an assignment that minimizes the maximum load over machines and time.
We present a polynomial time approximation scheme for the case in which the number of machines is fixed.We also show that for the case in which the number of machines is given as part of the input (i.e., not fixed), no algorithm can achieve a better approximation ratio than 4/3 unless P = NP.
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.
Similar content being viewed by others
References
Y. Azar. On-line load balancing. In A. Fiat and G. Woeginger, editors, Online Algorithms-The State of the Art, chapter 8, pages 178–195. Springer, 1998.
Y. Azar and L. Epstein. On-line load balancing of temporary tasks on identical machines. In 5th Israeli Symp. on Theory of Computing and Systems, pages 119–125, 1997.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
M. R. Garey and D. S. Johnson. Computers and Intractability. W.H. Freeman and Company, San Francisco, 1979.
R. L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563–1581, 1966.
R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math, 17:263–269, 1969.
D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J. of the ACM, 34(1):144–162, January 1987.
R. M. Karp. Reducibility among Combinatorial Problems, R. E. Miller and J. W. Thatcher (eds.), Complexity of Computer Computations. Plenum Press, 1972.
J. K. Lenstra, D. B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. mathprog, 46:259–271, 1990.
S. Sahni. Algorithms for scheduling independent tasks. Journal of the Association for Computing Machinery, 23:116–127, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azar, Y., Regev, O. (1999). Off-Line Temporary Tasks Assignment. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_15
Download citation
DOI: https://doi.org/10.1007/3-540-48481-7_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66251-8
Online ISBN: 978-3-540-48481-3
eBook Packages: Springer Book Archive