Abstract:
We present randomized online algorithms for scheduling on m = 3; : : : ; 7 machines. For two machines, a randomized algorithm achieving a competitive ratio of 4 3 was found by Bartal, Fiat, Karloff and Vohra [3]. These same authors show a matching lower bound. Seiden has presented a randomized algorithm which achieves competitive ratios of 1.55665, 1.65888, 1.73376, 1.78295
Citations
|
253
|
Bounds for certain multiprocessing anomalies
– Graham
- 1966
|
|
102
|
New algorithms for an ancient scheduling problem
– Bartal, Fiat, et al.
- 1992
|
|
74
|
Better bounds for online scheduling
– Albers
- 1997
|
|
64
|
A better algorithm for an ancient scheduling problem
– Karger, Phillips, et al.
- 1996
|
|
43
|
An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling
– Galambos, Woeginger
- 1993
|
|
43
|
Randomized competitive algorithms for the list update problem
– Reingold, Westbrook, et al.
- 1994
|
|
34
|
A lower bound for randomized on-line multiprocessor scheduling
– Sgall
- 1997
|
|
29
|
New lower and upper bounds for on-line scheduling
– Chen, Vliet, et al.
- 1994
|
|
28
|
A better lower bound for on-line scheduling
– Bartal, Karloff, et al.
- 1994
|
|
25
|
On the Performance of On-Line Algorithms for Partition Problems
– Faigle, Kern, et al.
- 1989
|
|
23
|
A lower bound for randomized on-line scheduling algorithms
– Chen, Vliet, et al.
- 1994
|
|
19
|
Online scheduling revisited
– Fleischer, Wahl
- 2000
|
|
17
|
Randomized algorithms for that ancient scheduling problem
– Seiden
- 1997
|
|
16
|
Generating adversaries for request-answer games
– Gormley, Reingold, et al.
- 2000
|
|
15
|
A randomized algorithm for two servers on the line
– Bartal, Chrobak, et al.
- 2000
|
|
13
|
Randomized Online Scheduling on Two Uniform Machines
– Epstein, Noga, et al.
- 1999
|
|
7
|
Randomized online multiprocessor scheduling. Algorithmica
– Seiden
- 2000
|
|
3
|
On the power of barely random online algorithms
– Ben-David, Dichterman, et al.
- 1998
|
|
