Upper bound on the number of processors for scheduling with interprocessor communication delays.
Aziz MoukrimPublished in: Math. Methods Oper. Res. (2000)
Keyphrases
- communication delays
- control theory
- execution times
- upper bound
- precedence relations
- directed networks
- np hard
- multiprocessor systems
- computational complexity
- processing times
- worst case
- scheduling problem
- lower bound
- branch and bound algorithm
- precedence constraints
- resource constrained project scheduling problem
- state space