Subject
Applied Mathematics,Computational Mathematics
Reference15 articles.
1. The third comprehensive survey on scheduling problems with setuptimes/costs;Allahverdi;Eur. J. Oper. Res.,2015
2. A survey of scheduling problems with setup times or costs;Allahverdi;Eur. J. Oper. Res.,2008
3. Graph Theory;Bondy,2007
4. Scheduling tasks with nonuniform deadlines on two processors;Garey;J. Assoc. Comput. Mach.,1976
5. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献