Art

J-GLOBAL ID：201302278751817900   Reference number：13A0730954

The Hybrid Approach of LCO and SA to Solve Job-shop Scheduling Problem

ジョブショップスケジューリング問題を解くためのLCOとSAのハイブリッドアプローチ

Author (4)： TAMURA Yasumasa (Hokkaido Univ., Hokkaido, JPN) ,  SUZUKI Ikuo (Kitami Inst. of Technol., Hokkaido, JPN) ,  YAMAMOTO Masahito (Hokkaido Univ., Hokkaido, JPN) ,  FURUKAWA Masashi (Hokkaido Univ., Hokkaido, JPN)
Material： システム制御情報学会論文誌  (Transactions of the Institute of Systems, Control and Information Engineers)
Volume： 26  Issue： 4  Page： 121-128  Publication year： Apr. 2013 
JST Material Number： L0070A  ISSN： 1342-5668  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *job shop scheduling ,  combinatorial optimization problem ,  clustering ,  simulated annealing ,  *numerical solution ,  modification
Semi thesaurus term： *hybrid method

JST classification (1)： Process control  (KB03030P)

Reference (7)：

• [1] M. R. Garey and D. S. Johnson: Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman and Company (1979)
• [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] 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] 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] 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)

Terms in the title (3)： ジョブショップスケジューリング問題 ,  SA ,  ハイブリッドアプローチ