Semi-on-Line Scheduling Problem for Maximizing the Minimum Machine Completion Time on Three Special Uniform Machines
暂无分享,去创建一个
[1] Guochuan Zhang,et al. Semi On-Line Scheduling on Two Identical Machines , 1999, Computing.
[2] Yong He. The optimal on-line parallel machine scheduling , 2000 .
[3] Gerhard J. Woeginger,et al. The exact LPT-bound for maximizing the minimum completion time , 1992, Oper. Res. Lett..
[4] Gerhard J. Woeginger,et al. A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..
[5] Yong He,et al. Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time , 2002, J. Comb. Optim..
[6] Leah Epstein. Tight bounds for bandwidth allocation on two links , 2005, Discret. Appl. Math..
[7] D. K. Friesen,et al. SCHEDULING TO MAXIMIZE THE MINIMUM PROCESSOR FINISH TIME IN A MULTIPROCESSOR SYSTEM , 1982 .
[8] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[9] Shijie Sun,et al. Semi On-Line Scheduling Problem for Maximizing the Minimum Machine Completion Time on Two Uniform Machines , 2006, J. Syst. Sci. Complex..
[10] Yossi Azar,et al. On‐line machine covering , 1998 .