The m-machine flowshop problem with unit-time operations and intree precedence constraints

The m-machine flowshop problem with unit-time operations and intree precedence constraints

0.00 Avg rating—0 Votes
Article ID: iaor20051758
Country: Netherlands
Volume: 33
Issue: 3
Start Page Number: 263
End Page Number: 266
Publication Date: May 2005
Journal: Operations Research Letters
Authors: , ,
Keywords: combinatorial analysis
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.

Reviews

Required fields are marked *. Your email address will not be published.