The two-machine flow shop problem with arbitrary precedence relations
From MaRDI portal
Publication:2366083
DOI10.1016/0377-2217(93)90180-UzbMath0778.90029MaRDI QIDQ2366083
Graham B. McMahon, Chong John Lim
Publication date: 29 June 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
The three-machine flow-shop problem with arbitrary precedence relations ⋮ Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ Two branch and bound algorithms for the permutation flow shop problem
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for two-machine flow-shop sequencing with precedence constraints
- Sequencing with general precedence constraints
- Optimal two- and three-stage production schedules with setup times included
- The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
- The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
- Sequencing with Series-Parallel Precedence Constraints
- The Recognition of Series Parallel Digraphs
This page was built for publication: The two-machine flow shop problem with arbitrary precedence relations