Technical Note—Precedence Relations of the Flow-Shop Problem

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

Operations Research, 1981, vol. 29, issue 2, 400-411

Abstract: A theory based on the precedence relation (dominance condition with no fixed presequence) concept has been developed and applied to the flow-shop problem. The nature and scope of two major precedence relations have been explored. The paper offers a natural generalization of the Johnson algorithm for the general case, and proves sufficient conditions for optimality of the resulting sequence.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.2.400 (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:29:y:1981:i:2:p:400-411

Access Statistics for this article

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