On the Hardness of Scheduling With Non-Uniform Communication Delays.
Sami DaviesJanardhan KulkarniThomas RothvossSai SandeepJakub TarnawskiYihao ZhangPublished in: CoRR (2021)
Keyphrases
- communication delays
- np hard
- precedence relations
- control theory
- directed networks
- execution times
- multiprocessor systems
- processing times
- np complete
- approximation algorithms
- computational complexity
- precedence constraints
- branch and bound algorithm
- scheduling problem
- worst case
- resource constrained project scheduling problem
- special case
- lower bound
- dynamical systems
- genetic algorithm
- linear systems
- single machine scheduling problem