On-line bin-stretching

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

Volumn 1518, Issue , 1998, Pages 71-81

  Azar, Yossi ^a   Regev, Oded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Bin packing; Bin stretching; Load balancing; On line algorithms; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; NETWORK MANAGEMENT; RANDOM PROCESSES; RESOURCE ALLOCATION; SCHEDULING; SCHEDULING ALGORITHMS;

BIN PACKING; BIN PACKING PROBLEM; BIN STRETCHING; LOWER BOUNDS; MAKESPAN; MAXIMUM LOAD; ON-LINE ALGORITHMS;

BINS;

EID: 77955834557     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49543-6_7     Document Type: Conference Paper

References (21)

1. S. Albers. Better bounds for on-line scheduling. In Proc. 29th ACM Symp. on Theory of Computing, pages 130-139, 1997.
2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proc. 25th ACM Symposium on the Theory of Computing, pages 623-631, 1993. Also in Journal of the ACM 44:3 (1997) pp. 486-504.
3. B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown duration. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pages 321-327, 1994.
4. Y. Azar, A. Broder, and A. Karlin. On-line load balancing. In Proc. 33rd IEEE Symposium on Foundations of Computer Science, pages 218-225, 1992. Also in Theoretical Compute Science 130 (1994) pp. 73-84.
5. Y. Azar and L. Epstein. On-line load balancing of temporary tasks on identical machines. In 5th Israeli Symposium. on Theory of Computing and Systems, pages 119-125, 1997.
6. Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, and O. Waarts. On-line load balancing of temporary tasks. In Proc. Workshop on Algorithms and Data Structures, pages 119-130, August 1993.
7. Y. Bartal, A. Fiat, H. Karlo, and R. Vohra. New algorithms for an ancient scheduling problem. In Proc. 24th ACM Symposium on Theory of Algorithms, pages 51-58, 1992. To appear in Journal of Computer and System Sciences.
8. B. Chen, A. van Vliet, and G. Woeginger. A lower bound for randomized on-line scheduling algorithms. Information Processing Letters, 51:219-222, 1994.
9. 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.
10. E. G. Co man, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: a survey. In D. Hochbaum, editor, Approximation algorithms. 1996.
11. U. Faigle, W. Kern, and G. Turan. On the performance of online algorithms for partition problems. Acta Cybernetica, 9:107-119, 1989.
12. G. Galambos and G. J. Woeginger. An on-line scheduling heuristic with better worst case ratio than graham's list scheduling. SIAM J. Computing, 22:349-355, 1993.
13. M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, San Francisco, 1979.
14. R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
15. R.L. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math, 17:263-269, 1969.
16. D. Hochbaum and D. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing, 17(3):539-551, 1988.
17. 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.
18. D. S. Johnson. Near optimal bin packing algorithms. PhD thesis, MIT, Cambridge, MA, 1973.
19. D. R. Karger, S. J. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. In Proc. of the 5th ACM-SIAM Symposium on Discrete Algorithms, pages 132-140, 1994.
20. H. Kellerer, V. Kotov, M. G. Speranza, and Zs. Tuza. Semi on-line algorithms for the partition problem. Operations Research Letters. To appear.
21. J. Sgall. On-line scheduling on parallel machines. Technical Report Technical Report CMU-CS-94-144, Carnegie-Mellon University, Pittsburgh, PA, USA, 1994.