Author:
Leung Joseph Y. -T.,Li Haibing,Pinedo Michael
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference17 articles.
1. Barnes, J., M. Laguna, and F. Glover, “An overview of Tabu Search approaches to production scheduling problems,” in D. Brown and W. Scherer (eds.), Intelligent Scheduling Systems, Kluwer Academic Publishers, 1995, pp. 101–127.
2. Du, J. and J. Y.-T. Leung, “Minimizing total tardiness on one machine is NP-hard,” Mathematics of Operations Research, 15, 483–495 (1990).
3. Emmons, H., “One-machine sequencing to minimize certain functions of job tardiness,” Operations Research, 17, 701–715 (1969).
4. Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
5. Glover, F. and M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, USA, 1997.
Cited by
76 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献