An iterative algorithm for scheduling UET tasks with due dates and release times
暂无分享,去创建一个
[1] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..
[2] Yakov Zinder,et al. An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness , 1998, Ann. Oper. Res..
[3] Gerhard J. Woeginger,et al. A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .
[4] Gaurav Singh,et al. Preemptive Scheduling on Parallel Processors with due dates , 2005, Asia Pac. J. Oper. Res..
[5] Peter Brucker,et al. Scheduling Algorithms , 1995 .
[6] David S. Johnson,et al. Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..
[7] David S. Johnson,et al. Scheduling Tasks with Nonuniform Deadlines on Two Processors , 1976, J. ACM.
[8] Denis Trystram,et al. A New Insight into the Coffman-Graham Algorithm , 1994, SIAM J. Comput..
[9] Shui Lam,et al. Worst Case Analysis of Two Scheduling Algorithms , 1977, SIAM J. Comput..