Author:
Choi Byung-Cheon,Yoon Suk-Hun
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference17 articles.
1. Bulfin, R. L., & M’Hallah, R. (2003). Minimizing the weighted number of tardy jobs on a two-machine flow shop. Computers and Operations Research, 30, 1887–1900.
2. Cepek, O., & Sung, S. C. (2005). A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers and Operations Research, 32, 3265–3271.
3. Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1996). Introduction to algorithms. Cambridge: MIT Press.
4. Dauzere-Peres, S., & Sevaux, M. (2003). Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Research Logistics, 50, 273–288.
5. Garey, M. R. & Johnson, D. S. (1979). Computers and intractability, a guide to the theory of NP-completeness. New York: Freeman.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献