Login / Signup
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights.
Vincent T'kindt
Lei Shang
Federico Della Croce
Published in:
J. Comb. Optim. (2020)
Keyphrases
</>
scheduling problem
learning algorithm
orders of magnitude
computationally efficient
upper bound
computational complexity
significant improvement
tabu search
np hard
computational cost
data mining techniques
theoretical analysis
convergence rate
single machine
benchmark problems
job shop scheduling