A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
暂无分享,去创建一个
[1] Ellis Horowitz,et al. Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.
[2] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[3] Michael A. Langston,et al. Bounds for Multifit Scheduling on Uniform Processors , 1983, SIAM J. Comput..
[4] David B. Shmoys,et al. Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results , 1985, FOCS.
[5] David B. Shmoys,et al. Using dual approximation algorithms for scheduling problems: practical and theoretical results , 1987 .
[6] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[7] Jane W.-S. Liu,et al. Bounds on Scheduling Algorithms for Heterogeneous Comnputing Systems , 1974, IFIP Congress.
[8] Oscar H. Ibarra,et al. Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..
[9] Sartaj Sahni,et al. Bounds for List Schedules on Uniform Processors , 1980, SIAM J. Comput..
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .