Subject
Computational Mathematics,Computational Theory and Mathematics,Modelling and Simulation
Reference3 articles.
1. Complexity of scheduling tasks with time dependent execution times;Ho;Information Processing Letters,1993
2. The complexity of single machine scheduling with deadlines and identical decreasing rates of processing time;Cheng,1996
3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献