Login / Signup
Complexity and approximation for precedence constrained scheduling problems with large communication delays.
Rodolphe Giroudeau
Jean-Claude König
Farida Kamila Moulai
Jérôme Palaysi
Published in:
Theor. Comput. Sci. (2008)
Keyphrases
</>
scheduling problem
communication delays
processing times
precedence relations
directed networks
np hard
control theory
precedence constraints
worst case
error bounds
execution times
flowshop
computational complexity
job shop scheduling problem
multiprocessor systems
job shop
setup times
space complexity
lower bound