Preemptive scheduling of uniform machines subject to release dates : (preprint)
暂无分享,去创建一个
Eugene L. Lawler | Jan Karel Lenstra | A. H. G. Rinnooy Kan | J. Labetoulle | E. Lawler | J. Lenstra | A. Kan | J. Labetoulle
[1] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[2] Sartaj Sahni,et al. Preemptive Scheduling with Due Dates , 1979, Oper. Res..
[3] Sartaj Sahni,et al. Scheduling Independent Tasks with Due Times on a Uniform Processor System , 1980, JACM.
[4] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.
[5] Teofilo F. Gonzalez,et al. Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.
[6] W. A. Horn. Some simple scheduling algorithms , 1974 .
[7] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .
[8] Sartaj Sahni,et al. Nearly On Line Scheduling of a Uniform Processor System with Release Times , 1979, SIAM J. Comput..
[9] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[10] E. L. Lawler,et al. Preemptive Scheduling of. Precedence-Constrained Jobs on Parallel Machines , 1981 .
[11] Shui Lam,et al. A Level Algorithm for Preemptive Scheduling , 1977, J. ACM.