论文信息 - The optimal on-line parallel machine scheduling - 字舞流文

The optimal on-line parallel machine scheduling

Abstract This paper investigates on-line parallel machine scheduling problems. We show the optimality of the classical LS algorithm.

[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] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] David R. Karger,et al. A better algorithm for an ancient scheduling problem , 1994, SODA '94.

[6] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.

[7] Gerhard J. Woeginger,et al. The exact LPT-bound for maximizing the minimum completion time , 1992, Oper. Res. Lett..

[8] Gerhard J. Woeginger,et al. A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..

[9] Gerhard J. Woeginger,et al. An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling , 1993, SIAM J. Comput..

[10] György Turán,et al. On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..