Randomized algorithms for that ancient scheduling problem

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

Volumn 1272, Issue , 1997, Pages 210-223

  Seiden, Steve ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; LOWER BOUNDS; ON-LINE FASHION; PARALLEL MACHINE; RANDOMIZED ALGORITHMS; SCHEDULING INDEPENDENT JOBS; SCHEDULING PROBLEM;

SCHEDULING;

EID: 84947908225     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_61     Document Type: Conference Paper

References (12)

1. Albers, S. Better bounds for online scheduling. In Proc. 29th ACM Symposium on Theory of Computing (STOC) (1997), pp. 130-139.
2. Bartal, Y., Fiat, A., Karloff, H, and Vohra, R. New algorithms for an ancient scheduling problem. In Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing (May 1992), pp. 51-58.
3. Bartal, Y., Fiat, A., Karloff, H., and Vohra, R. New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences 51, 3 (Dec 1995), 359-366.
4. Bartal, Y., Karloff, H., and Rabani, Y. A better lower bound for on-line scheduling. Information Processing Letters 50, 3 (May 1994), 113-116.
5. Chen, B., van Vliet, A., and Woeginger, G. A lower bound for randomized on-line scheduling algorithms. Information Processing Letters 51, 5 (September 1994), 219-22.
6. Chen, B., van Vliet, A., and Woeginger, G. New lower and upper bounds for on-line scheduling. Operations Research Letters 16, 4 (November 1994), 221-230.
7. Faigle, U., Kern, W., and Turàn, G. On the performance of on-line algorithms for partition problems. Acta Cybernetica 9, 2 (1989), 107-19.
8. Galambos, G., and Woeginger, G. An online scheduling heuristic with better worst case ratio than Graham’s list scheduling. SIAM Journal on Computing 22, 2 (April 1993), 349-355.
9. Graham, R. Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal 45 (1966), 1563-1581.
10. Karger, D., Phillips, S., and Torng, E. A better algorithm for an ancient scheduling problem. In Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (1994), pp. 132-140.
11. Karger, D., Phillips, S., and Torng, E. A better algorithm for an ancient scheduling problem. Journal of Algorithms 20, 2 (March 1996), 400-430.
12. Sgall, J. On-Line Scheduling on Parallel Machines. PhD thesis, Carnegie-Mellon University, 1994.