New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
暂无分享,去创建一个
[1] Zsolt Tuza,et al. Semi on-line algorithms for the partition problem , 1997, Oper. Res. Lett..
[2] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[3] György Turán,et al. On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..
[4] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[5] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.
[6] Guochuan Zhang,et al. Semi On-Line Scheduling on Two Identical Machines , 1999, Computing.
[7] Zsolt Tuza,et al. Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items , 2003, Algorithmica.