论文信息 - List’s worst-average-case or WAC ratio

List’s worst-average-case or WAC ratio

Abstract We analyze the List scheduling algorithm for the problem of minimizing makespan using a worst-average-case or wac analysis technique, previously used by Kenyon for analyzing the Best Fit bin packing algorithm. We show that List’s worst-average-case or wac ratio asymptotically approaches 2, as m→∞. Thus, List’s worst-case behavior is not overly dependent on the order of job arrivals.

Eric Torng | Christopher J. Osborn

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

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

[3] Ramaswamy Chandrasekaran,et al. Improved Bounds for the Online Scheduling Problem , 2003, SIAM J. Comput..

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

[5] C. Kenyon. Best-fit bin-packing with random order , 1996, SODA '96.

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

[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] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.

[10] Rudolf Fleischer,et al. On‐line scheduling revisited , 2000 .

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

[12] Susanne Albers,et al. Better bounds for online scheduling , 1997, STOC '97.