论文信息 - Parallel machines scheduling with nonsimultaneous machine available time - 字舞流文

Parallel machines scheduling with nonsimultaneous machine available time

Chung-Yee Lee | Chung-Yee Lee

[1] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .

[2] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[3] Edward G. Coffman,et al. An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

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

[5] S. Elmaghraby,et al. Knapsack-Based Approaches to the Makespan Problem on Multiple Processors , 1980 .

[6] Donald K. Friesen,et al. Tighter Bounds for the Multifit Processor Scheduling Algorithm , 1984, SIAM J. Comput..

[7] 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).

[8] Michael A. Langston,et al. Evaluation of a MULTIFIT-Based Scheduling Algorithm , 1986, J. Algorithms.

[9] J. B. G. Frenk,et al. The Asymptotic Optimality of the LPT Rule , 1987, Math. Oper. Res..

[10] Chung-Yee Lee,et al. Multiprocessor scheduling: combining LPT and MULTIFIT , 1988, Discret. Appl. Math..