Login / Signup
An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming.
Jelke J. van Hoorn
Agustín Nogueira
Ignacio Ojea
Joaquim A. S. Gromicho
Published in:
Comput. Oper. Res. (2017)
Keyphrases
</>
job shop scheduling problem
dynamic programming
job shop scheduling
combinatorial optimization
critical path
tabu search
production scheduling
benchmark problems
scheduling problem
genetic algorithm
simulated annealing
benchmark instances
combinatorial optimization problems
memetic algorithm
graph model
tabu search algorithm
job shop
single machine
linear programming
metaheuristic