Randomized Algorithms for that Ancient Scheduling Problem
暂无分享,去创建一个
[1] Susanne Albers,et al. Better bounds for online scheduling , 1997, STOC '97.
[2] David R. Karger,et al. A better algorithm for an ancient scheduling problem , 1994, SODA '94.
[3] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.
[4] Gerhard J. Woeginger,et al. New lower and upper bounds for on-line scheduling , 1994, Oper. Res. Lett..
[5] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[6] Yuval Rabani,et al. A Better Lower Bound for On-Line Scheduling , 1994, Inf. Process. Lett..
[7] Gerhard J. Woeginger,et al. A Lower Bound for Randomized On-Line Scheduling Algorithms , 1994, Information Processing Letters.
[8] David P. Williamson,et al. On-Line Scheduling of Parallel Machines , 1990 .
[9] Gerhard J. Woeginger,et al. An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling , 1993, SIAM J. Comput..
[10] György Turán,et al. On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..