Article ID Journal Published Year Pages File Type
10524101 Operations Research Letters 2005 4 Pages PDF
Abstract
We consider the flowshop problem with unit-time operations and intree precedence constraints, with the objective to minimize the total completion time. We present a polynomial-time algorithm assuming that the number of machines is fixed. This proves a recently stated conjecture.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The m-machine flowshop problem with unit-time operations and intree precedence constraints
Authors
, , ,