Off-line temporary tasks assignment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1643, Issue , 1999, Pages 163-171

  Azar, Yossi ^a   Regev, Oded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; ARRIVAL TIME; DEPARTURE TIME; MAXIMUM LOAD; PARALLEL MACHINE; POLYNOMIAL TIME APPROXIMATION SCHEMES; TEMPORARY TASKS; WEIGHTS OF JOBS;

APPROXIMATION ALGORITHMS;

EID: 84958093314     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_15     Document Type: Conference Paper

References (10)

1. 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.
2. 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.
3. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
4. M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, San Francisco, 1979.
5. R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563–1581, 1966.
6. R.L. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math, 17:263–269, 1969.
7. 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.
8. R.M. Karp. Reducibility among Combinatorial Problems, R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations. Plenum Press, 1972.
9. J.K. Lenstra, D.B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. mathprog, 46:259–271, 1990.
10. S. Sahni. Algorithms for scheduling independent tasks. Journal of the Association for Computing Machinery, 23:116–127, 1976.