The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations.
Jeffrey B. SidneyPublished in: Oper. Res. (1979)
Keyphrases
- series parallel
- precedence relations
- precedence constraints
- maximum flow
- parallel machines
- scheduling problem
- flowshop
- branch and bound algorithm
- approximation algorithms
- directed graph
- single machine
- partially ordered
- temporal reasoning
- single machine scheduling problem
- partial order
- resource constrained project scheduling problem
- global constraints
- parallel computing
- tabu search
- processing times
- shared memory
- lower bound
- branch and bound
- optimization algorithm
- upper bound