Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem

Wlodzimierz Szwarc
Additional contact information
Wlodzimierz Szwarc: University of Wisconsin, Milwaukee, Wisconsin

Operations Research, 1977, vol. 25, issue 1, 70-77

Abstract: Consider the 3 × n flow-shop problem with machines A , B , and C . By AB and BC optimum we mean optimal solutions produced by Johnson's method for the two-machine problems AB and BC , respectively. Although not every permutation that is an AB and BC optimum simultaneously is an optimal solution of the entire problem, the set P of such permutations does contain an ABC optimum whenever it is not empty. We summarize known analytical results and solution procedures for the 3 × n flow-shop problem.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.1.70 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:25:y:1977:i:1:p:70-77

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().