Art

J-GLOBAL ID：200902246284458363   Reference number：03A0701263

A New Method of Shifting Bottleneck with Tabu Search for Solving Flexible Flow Shop Problems

フレキシブルフローショップ問題を解くためのタブー探索によるシフティング・ボトルネックの新しい方法

Author (3)： XU Y (Kyoto Inst. of Technol., Kyoto) ,  SANNOMIYA N (Kyoto Inst. of Technol., Kyoto) ,  TIAN Y (ATR, Kyoto)
Material： 計測自動制御学会論文集  (Transactions of the Society of Instrument and Control Engineers)
Volume： 39  Issue： 9  Page： 865-871  Publication year： Sep. 30, 2003 
JST Material Number： S0104A  ISSN： 0453-4654  CODEN： KJSRA  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *flow shop scheduling ,...

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

JST classification (2)： Process control  (KB03030P) ,  Network methods  (KA03040X)

Reference (12)：

• GUPTA, J. Two-stage hybrid flow shop scheduling problem. Operations research. 1988, 39, 359/364
• HOOGEVEEN, J. Minimizing makespan in a multi-processor flowshop is strongly NP-hard. European journal of operational research. 1993, 89, 172/175
• WITTROCK, R. An adaptable scheduling algorithm for flexible flow lines. Operations research. 1988, 36, 445/453
• BRAH, S. Branch-and-bound algorithm for flowshop with multiple processors. European journal of operational research. 1991, 51, 88/99
• CHENG, J. A shifting bottleneck approach for a parallel-machine flowshop scheduling problem. Journal of the operations research society of Japan. 2001, 44-22, 140/156

Terms in the title (2)： フローショップ ,  タブー探索