Scheduling trees with large communication delays on two identical processors.
Foto N. AfratiEvripidis BampisLucian FintaIoannis MilisPublished in: J. Sched. (2005)
Keyphrases
- worst case
- communication delays
- np hard
- precedence relations
- control theory
- execution times
- directed networks
- multiprocessor systems
- special case
- processing times
- np complete
- precedence constraints
- resource constrained project scheduling problem
- branch and bound algorithm
- dynamical systems
- response time
- search algorithm