Semi On-Line Scheduling Problem for Maximizing the Minimum Machine Completion Time on Two Uniform Machines
暂无分享,去创建一个
[1] Guochuan Zhang,et al. Semi On-Line Scheduling on Two Identical Machines , 1999, Computing.
[2] D. K. Friesen,et al. SCHEDULING TO MAXIMIZE THE MINIMUM PROCESSOR FINISH TIME IN A MULTIPROCESSOR SYSTEM , 1982 .
[3] Gerhard J. Woeginger,et al. A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..
[4] Yossi Azar,et al. On-Line Machine Covering , 1997, ESA.
[5] Leah Epstein. Tight bounds for bandwidth allocation on two links , 2005, Discret. Appl. Math..
[6] He Yong. Semi-on-line scheduling problems for maximizing the minimum machine completion time , 2001 .
[7] Yong He,et al. Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time , 2002, J. Comb. Optim..
[8] Gerhard J. Woeginger,et al. The exact LPT-bound for maximizing the minimum completion time , 1992, Oper. Res. Lett..