Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. On the complexity of scheduling with large communication delays;Bampis;Eur. J. Oper. Res.,1996
2. Scheduling with release times and deadlines on a minimum number of machines;Cieliebak,2004
3. Scheduling chain-structured tasks to minimize makespan and mean flow time;Du;Inf. Comput.,1991
4. A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines;Fisher,2005
5. Strong NP-completeness results: motivation, examples, and implications;Garey;J. Assoc. Comput. Mach.,1978
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献