Author:
Tamura Yasumasa,Suzuki Ikuo,Yamamoto Masahito,Furukawa Masashi
Publisher
The Institute of Systems, Control and Information Engineers
Reference7 articles.
1. [1] M. R. Garey and D. S. Johnson: Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman and Company (1979)
2. [2] R. Nakano and T. Yamada: Conventional genetic algorithm for job shop problems; Proceedings of The Fourth International Conference on Genetic Algorithms, pp. 474-479 (1991)
3. [3] P. J. M. van Laarhoven, E. H. L. Aarts and J. K. Lenstra: Job shop scheduling by simulated annealing; Operations Research, INFORMS, p. 113-125 (1992)
4. [4] M. Furukawa, M. Watanabe and Y. Matsumura: Lcoal Clustering Organization (LCO) solving a large-scale TSP; Journal of Robotics and Mechatronics, Vol. 17, No. 5, p. 560 (2005)
5. [5] M. Furukawa, Y. Matsumura and M. Watanabe: Development of local clustering organization applied to job-shop scheduling problem; Journal of the Japan Society for Precision Engineering (CD-ROM), Vol. 72, No. 7, p. 867-872 (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献