Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items
暂无分享,去创建一个
[1] Hans Kellerer,et al. Linear compound algorithms for the partitioning problem , 2000 .
[2] Jirí Sgall,et al. On-line Scheduling , 1996, Online Algorithms.
[3] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[4] Jan Karel Lenstra,et al. Sequencing and scheduling : an annotated bibliography , 1997 .
[5] David B. Shmoys,et al. Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[6] Susanne Albers,et al. Better bounds for online scheduling , 1997, STOC '97.
[7] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[8] György Turán,et al. On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[11] Zsolt Tuza,et al. Semi on-line algorithms for the partition problem , 1997, Oper. Res. Lett..
[12] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.