The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
Published Online:1 Aug 1979https://doi.org/10.1287/opre.27.4.792
- Cited by
- Computers & Operations Research, Vol. 144
- 25 November 2021 | RAIRO - Operations Research, Vol. 55, No. 6
- IEEE Transactions on Automation Science and Engineering, Vol. 14, No. 4
- 18 April 2017 | International Journal of Production Research, Vol. 55, No. 11
- Computers & Operations Research, Vol. 36, No. 11
- European Journal of Operational Research, Vol. 193, No. 1
- Data & Knowledge Engineering, Vol. 66, No. 3
- IIE Transactions, Vol. 37, No. 12
- Journal of Combinatorial Optimization, Vol. 8, No. 1
- European Journal of Operational Research, Vol. 109, No. 1
- Journal of Intelligent Manufacturing, Vol. 6, No. 2
- European Journal of Operational Research, Vol. 78, No. 2
- Computers & Industrial Engineering, Vol. 26, No. 1
- ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, Vol. 37, No. 1
- European Journal of Operational Research, Vol. 64, No. 2
- Naval Research Logistics, Vol. 37, No. 5
- Discrete Applied Mathematics, Vol. 17, No. 1-2
- European Journal of Operational Research, Vol. 17, No. 2
- Journal of Soviet Mathematics, Vol. 24, No. 1
- 29 March 2011 | RAIRO - Operations Research, Vol. 17, No. 2
Volume 27, Issue 4
July-August 1979
Pages 629-854
Article Information
Metrics
Information
- Published Online:August 01, 1979
© 1979 INFORMS
Cite as
Clyde L. Monma, (1979) The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions. Operations Research 27(4):792-798.
https://doi.org/10.1287/opre.27.4.792
