Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem

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

Operations Research, 1973, vol. 21, issue 6, 1250-1259

Abstract: For solving the flow-shop scheduling problem, this paper examines elimination techniques that reduce the set of solutions to a subset that must contain the optimal solution being sought. The paper shows (1) that the elimination method of Szwarc [ Naval Res. Log. Quart. 18, 295–305 (1971)] removes at least as many solutions as any other method, and is therefore optimal, and (2) how to construct a general counterexample to any procedure that removes more sequences than this optimal method.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.6.1250 (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:21:y:1973:i:6:p:1250-1259

Access Statistics for this article

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