The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
Operations Research · 1979 · Volume 27 · Issue 4
Abstract
The n -job 2-machine flow shop problem with series-parallel precedence constraints is considered with the objective to minimize makespan. Recent results of Kurisu are utilized in the development of a polynomial bounded optimal algorithm.
Enable JavaScript for citation tools and additional paper interactions.