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

✍ Scribed by Igor Averbakh; Oded Berman; Ilya Chernykh

• Publisher: Elsevier Science
• Year: 2005
• Tongue: English
• Weight: 163 KB
• Volume: 33
• Category: Article
• ISSN: 0167-6377
• DOI: 10.1016/j.orl.2004.08.001

✦ Synopsis

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.