首页 | 本学科首页   官方微博 | 高级检索  
   检索      


A special case of the 3 × n flow shop problem
Authors:Fennell Burns  John Rooker
Abstract:Johnson 2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the corresponding three machine flow shop problem. Since that time, six other special cases have been solved, two contributed by Arthanari and Mukhopadhyay 1], two by Smith, Panwalkar, and Dudek 3], and two of a different nature by Szwarc 5]. This paper contributes an extension to one of the classes described by Szwarc.
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号