Author:
Li S. S.,Brucker P.,Ng C. T.,Cheng T. C. E.,Shakhlevich N. V.,Yuan J. J.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference12 articles.
1. Brucker, P. (2004). Scheduling algorithms. Berlin: Springer.
2. Brucker, P., & Shakhlevich, N. V. (2009). Inverse scheduling with maximum lateness objective. Journal of Scheduling, 12, 475–488.
3. Du, J., & Leung, J. Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483–495.
4. Fields, M. C., & Frederickson, G. N. (1990). A faster algorithm for the maximum weighted tardiness problem. Information Processing Letters, 36, 39–44.
5. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献