The two-machine flow shop problem with arbitrary precedence relations
- 22 January 1993
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 64 (2) , 249-257
- https://doi.org/10.1016/0377-2217(93)90180-u
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Algorithms for two-machine flow-shop sequencing with precedence constraintsEuropean Journal of Operational Research, 1984
- Sequencing with general precedence constraintsDiscrete Applied Mathematics, 1981
- The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and ExtensionsOperations Research, 1979
- The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence RelationsOperations Research, 1979
- Sequencing with Series-Parallel Precedence ConstraintsMathematics of Operations Research, 1979
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954