Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem

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

Operations Research, 1978, vol. 26, issue 1, 203-206

Abstract: This note examines the mathematical structure and applicability of a dominance condition of Gupta and Reddi for the three-machine flow-shop problem. It shows that this condition may eliminate fewer sequences than another dominance condition. A sequential procedure of the combined strength of the two conditions is presented. We also derive necessary conditions for the Gupta-Reddi condition.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.1.203 (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:26:y:1978:i:1:p:203-206

Access Statistics for this article

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