Optimal non-preemptive semi-online scheduling on two related machines
暂无分享,去创建一个
[1] James B. Orlin,et al. A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines , 1997, Oper. Res..
[2] Oscar H. Ibarra,et al. Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..
[3] Gregory Dobson,et al. Scheduling Independent Tasks on Uniform Processors , 1984, SIAM J. Comput..
[4] Gerhard J. Woeginger,et al. Semi-online scheduling with decreasing job sizes , 2000, Oper. Res. Lett..
[5] Gerhard J. Woeginger,et al. Randomized online scheduling on two uniform machines , 2001, SODA '99.
[6] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[7] Donald K. Friesen,et al. Tighter Bounds for LPT Scheduling on Uniform Processors , 1987, SIAM J. Comput..