Author:
Hall Nicholas G.,Potts Chris N.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference22 articles.
1. Albers, S. and P. Brucker. (1993). “The Complexity of One-Machine Batching Problems.” Discrete Applied Mathematics 47, 87–107.
2. Bruno, J. and P. Downey. (1978). “Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs.” SIAM Journal on Computing 7, 393–404.
3. Cheng, T.C.E., V.S. Gordon, and M.Y. Kovalyov. (1996). “Single Machine Scheduling with Batch Deliveries.” European Journal of Operational Research 94, 277–283.
4. Du, J. and J.Y.-T. Leung. (1990). “Minimizing Total Tardiness on One Machine is NP-Hard.” Mathematics of Operations Research 15, 483–495.
5. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman.
Cited by
79 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献