Technical Note—An Elimination Method for the Flow-Shop Problem

Kenneth R. Baker
Additional contact information
Kenneth R. Baker: Duke University, Durham, North Carolina

Operations Research, 1975, vol. 23, issue 1, 159-162

Abstract: Elimination methods for the flow-shop problem have been investigated by-several authors using special elimination conditions to construct a set of dominant schedules and then enumerate them in order to find an optimum. The few papers reporting computational experience with elimination algorithms indicate that the approach may be an efficient method for obtaining optimal schedules. This note builds a simple model in order to help provide some perspective on these computational results and to describe how elimination algorithms may behave in moderate-sized problems.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.1.159 (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:23:y:1975:i:1:p:159-162

Access Statistics for this article

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