论文信息 - On‐line scheduling revisited

On‐line scheduling revisited

We present a new on-line algorithm, MR, for non-preemptive scheduling of jobs with known processing times on m identical machines which beats the best previous algorithm for m⩾64. For m∞ its competitive ratio approaches 1+\sqrt{(1+1{\rm n} 2)/2}<1.9201. Copyright 2000 © John Wiley & Sons, Ltd.

Rudolf Fleischer | Michaela Wahl

[1] Gerhard J. Woeginger,et al. New lower and upper bounds for on-line scheduling , 1994, Oper. Res. Lett..

[2] Eric Torng,et al. Generating adversaries for request-answer games , 2000, SODA '00.

[3] Steven S. Seiden. Randomized Algorithms for that Ancient Scheduling Problem , 1997, WADS.

[4] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .

[5] Jirí Sgall. A Lower Bound for Randomized On-Line Multiprocessor Scheduling , 1997, Inf. Process. Lett..

[6] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .

[7] Yuval Rabani,et al. A Better Lower Bound for On-Line Scheduling , 1994, Inf. Process. Lett..

[8] David R. Karger,et al. A better algorithm for an ancient scheduling problem , 1994, SODA '94.

[9] Gerhard J. Woeginger,et al. Online Algorithms , 1998, Lecture Notes in Computer Science.

[10] Allan Borodin,et al. Online computation and competitive analysis , 1998 .

[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12] Gerhard J. Woeginger,et al. An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling , 1993, SIAM J. Comput..

[13] György Turán,et al. On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..

[14] Gerhard J. Woeginger,et al. A Lower Bound for Randomized On-Line Scheduling Algorithms , 1994, Information Processing Letters.