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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have