The Complexity of Scheduling Trees with Communication Delays.

Jan Karel Lenstra Marinus Veldhorst Bart Veltman

Published in: J. Algorithms (1996)

Keyphrases

communication delays
precedence relations
control theory
directed networks
execution times
np hard
multiprocessor systems
processing times
worst case
real time
computational complexity
scheduling algorithm
space complexity
scheduling problem