The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
- 1 August 1979
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 27 (4) , 782-791
- https://doi.org/10.1287/opre.27.4.782
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.Keywords
This publication has 0 references indexed in Scilit: