Login / Signup
Some complexity and approximation results for coupled-tasks scheduling problem according to topology.
Benoît Darties
Rodolphe Giroudeau
Jean-Claude König
Gilles Simonin
Published in:
CoRR (2017)
Keyphrases
</>
scheduling problem
approximation error
np hard
worst case
single machine
approximation algorithms
decision problems
earliness tardiness
learning algorithm
special case
dynamic programming
computational cost
tabu search
precedence constraints
error tolerance
increase in computational complexity