Scheduling series-parallel orders subject to 0/1-communication delays.
Rolf H. MöhringMarkus W. SchäffterPublished in: Parallel Comput. (1999)
Keyphrases
- series parallel
- communication delays
- precedence relations
- precedence constraints
- scheduling problem
- branch and bound algorithm
- control theory
- execution times
- parallel machines
- release dates
- np hard
- processing times
- approximation algorithms
- partially ordered
- single machine scheduling problem
- sequence dependent setup times
- tree decomposition
- temporal reasoning
- multiprocessor systems
- lower bound
- partial order
- global constraints
- resource constrained project scheduling problem
- genetic algorithm
- flowshop
- single machine
- dynamical systems
- search space
- optimal solution