## Abstract The paper examines all known special cases of the __m__X__n__ flow‐shop problem. It provides solution procedures to three new special cases along with the optimality proofs. The theory of the new special cases is based on the critical path concept.
A special case of the 3 × n flow shop problem
✍ Scribed by Fennell Burns; John Rooker
- Publisher
- John Wiley and Sons
- Year
- 1975
- Tongue
- English
- Weight
- 275 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
✦ Synopsis
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.
📜 SIMILAR VOLUMES