ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER

スポンサーリンク

概要

• 論文の詳細を見る

• A new flowshop scheduling problem related to automated manufacturing systems such as FMS's and FMC's is discussed. The problem is shown to be an extension of the two-machine flowship problem addressed by Johnson (or a special case of the three machine flowshop problem), and to be NP-hard. Some solvable cases are discussed.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Kise Hiroshi

  Dept. Of Mechanical And System Engineering Kyoto Institute Of Technology

関連論文

• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER

スポンサーリンク