Technical Note—An Elimination Method for the Flow-Shop Problem
- 1 February 1975
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 23 (1) , 159-162
- https://doi.org/10.1287/opre.23.1.159
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.Keywords
This publication has 0 references indexed in Scilit: