Semi on-line algorithms for the partition problem
暂无分享,去创建一个
Zsolt Tuza | Hans Kellerer | Maria Grazia Speranza | Vladimir Kotov | H. Kellerer | Z. Tuza | M. Speranza | V. Kotov
[1] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.
[2] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[3] Jirí Sgall. On-Line Scheduling of Parallel Jobs , 1994, MFCS.
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] David R. Karger,et al. A better algorithm for an ancient scheduling problem , 1994, SODA '94.
[6] Yuval Rabani,et al. A Better Lower Bound for On-Line Scheduling , 1994, Inf. Process. Lett..
[7] Rex K. Kincaid,et al. A look-ahead heuristic for scheduling jobs with release dates on a single machine , 1994, Comput. Oper. Res..
[8] Jeffrey B. Sidney,et al. Ordinal algorithms for parallel machine scheduling , 1996, Oper. Res. Lett..
[9] Edward F. Grove. Online bin packing with lookahead , 1995, SODA '95.
[10] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[11] Gerhard J. Woeginger,et al. An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling , 1993, SIAM J. Comput..
[12] György Turán,et al. On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..