Art

J-GLOBAL ID：200902117033480624   Reference number：02A0358117

Two-stage Tabu Search for Solving Parallel Machine Problems.

並列マシン問題を解くための二段タブー探索

Author (3)： XU Y (Kyoto Inst., Technol., Kyoto) ,  TIAN Y (Kyoto Univ., Kyoto) ,  SANNOMIYA N (Kyoto Inst., Technol., Kyoto)
Material： 計測自動制御学会論文集  (Transactions of the Society of Instrument and Control Engineers)
Volume： 38  Issue： 3  Page： 330-332  Publication year： Mar. 31, 2002 
JST Material Number： S0104A  ISSN： 0453-4654  CODEN： KJSRA  Document type： Article
Article type： 短報  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *assignment problem ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=02A0358117&from=J-GLOBAL&jstjournalNo=S0104A") }}

JST classification (1)： Other methods of operations research  (KA03070E)

Reference (8)：

• GLOVER, F. Tabu search-part I. ORSA J. Computing. 1986, 1, 190/206
• DU, J. Minimizing total tardiness on one processor is NP-hard. Mathematics of Operations Research. 1990, 15, 483/495
• TAMAKI, H. Parallel machine scheduling problem with a non-regular objective function. Journal of the Society of Instrument and Control Engineers. 1999, 35, 9, 1176/1182
• FUKUI, A. Autonomous decentralized scheduling system for an operation assignment problem. Systems, Control and Information. 1997, 10, 3, 107/115
• NAKAMULA, M. An autonomous distributed scheduling scheme for parallel machine problems. IEICE Transactions on Fundamentals. 2001, E84-A, 3, 763/770

Terms in the title (2)： 並列マシン ,  タブー探索