On-line scheduling with precedence constraints
暂无分享,去创建一个
[1] Leah Epstein,et al. Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines , 1998, APPROX.
[2] David P. Williamson,et al. Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[3] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[4] Jirí Sgall,et al. On-line Scheduling , 1996, Online Algorithms.
[5] Jeffrey M. Jaffe,et al. Algorithms for Scheduling Tasks on Unrelated Processors , 1981, JACM.
[6] Fabián A. Chudak,et al. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.
[7] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[8] Jeffrey M. Jaffe,et al. Efficient Scheduling of Tasks without Full Use of Processor Resources , 1980, Theor. Comput. Sci..
[9] Teofilo F. Gonzalez,et al. Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.
[10] David B. Shmoys,et al. A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..
[11] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[12] Shui Lam,et al. A Level Algorithm for Preemptive Scheduling , 1977, J. ACM.
[13] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .