Login / Signup
Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays.
Rodolphe Giroudeau
Jean-Claude König
Feryal-Kamila Moulaï
Jérôme Palaysi
Published in:
Euro-Par (2005)
Keyphrases
</>
scheduling problem
communication delays
np hard
processing times
single machine
control theory
directed networks
worst case
space complexity
execution times
tabu search
flowshop
setup times
error bounds
job shop scheduling problem