Temporary tasks assignment resolved

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 116-124

  Armon, Amitai ^a   Azar, Yossi ^a   Epstein, Leah ^b   Regev, Oded ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b INTERDISCIPLINARY CENTER   (Israel)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COMPETITIVE RATIO; FIXED NUMBERS; LINE LOADS; OFF-LINE PROBLEMS; TEMPORARY TASKS; UNRELATED MACHINES;

NETWORK MANAGEMENT;

EID: 2442537301     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. S. Albers. Better bounds for on-line scheduling. In Proc. 29th ACM Symp. on Theory of Computing, pages 130-139, 1997.
2. Jim Aspnes, Yossi Azar, Amos Fiat, Serge Plotkin, and Orli Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proc. 25th ACM Symp. on Theory of Computing, pages 623-631, May 1993.
3. 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.
4. Y. Azar, A. Z. Broder, and A. R. Karlin. On-line load balancing. Theoretical Computer Science, 130(1): 73-84, 1994. Also in Proc. 33rd IEEE FOCS, 1992, pp. 218-225.
5. 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.
6. Y. Azar, B. Kalyanasundaram, S. Plotkin, Kirk R. Pruhs, and Orli Waarts. On-line load balancing of temporary tasks. Journal of Algorithms, 22(1):93-110, 1997. Also in Proc. WADS'93, pp. 119-130.
7. Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. Journal of Algorithms, 18(2):221-237, 1995. Also in Proc. 3rd ACM-SIAM SODA, 1992, pp. 203-210.
8. Y. Azar, O. Regev, J. Sgall, and G. Woeginger. Off-line temporary tasks assignment. Theoretical Computer Science. To appear. Also in Proc. 7th Annual European Symposium on Algorithms 1999, pp. 163-171.
9. B. S. Baker, D. J. Brown, and H. P. Katseff. A 5/4 algorithm for two-dimensional packing. J. Algorithms, 2:348-368, 1981.
10. Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New algorithms for an ancient scheduling problem. In Proc. SJth ACM Symposium on Theory of Algorithms, pages 51-58, 1992. Also in Journal of Computer and System Sciences (1995) 359-366.
11. P. Berman, M. Charikar, and M. Karpinski. A note on on-line load balancing for related machines. In 5th annual Workshop on Algorithms and Data Structures, 1997.
12. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
13. B. Chen, A. van Vliet, and G. J. Woeginger. New lower and upper bounds for on-line scheduling. Operations Research Letters, 16:221-230, 1994.
14. W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1 + e in linear time. Combinatorica, 1:349-355, 1981.
15. M. R. Garey, R. L. Graham, D. S. Johnson, and A. C. C. Yao. Resource constrained scheduling as generalized bin packing. J. Comb. Th. Ser. A., 21:257-298, 1976.
16. R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
17. E. Horowitz and S. Sahni. Exact and approximate algorithms for scheduling non-identical processors. Journal of the Association for Computing Machinery, 23:317-327, 1976.
18. D. Karger, S. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 132-140, 1994.
19. J.K. Lenstra, D.B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Math. Prog., 46:259-271, 1990.
20. S. Phillips and J. Westbrook. On-line load balancing and network flow. In Proc. 25th ACM Symposium on Theory of Computing, pages 402-411, 1993.
21. S. Plotkin and Y. Ma. An improved lower bound for load balancing of tasks with unknown duration. Inform. Process. Lett., 62:301-303, 1997.
22. D. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming A, 62:461-474, 1993. Also in the proceeding of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993.
23. J. Westbrook. Load balancing for response time. In 3rd Annual European Symposium on Algorithms, 1995.