Login / Signup
A combination of two simple decoding strategies for the no-wait job shop scheduling problem.
Víctor M. Valenzuela
Carlos A. Brizuela
María Cosío León
Alma Danisa Romero Ocaño
Published in:
GECCO (2019)
Keyphrases
</>
job shop scheduling problem
critical path
job shop scheduling
production scheduling
tabu search
genetic algorithm
benchmark problems
scheduling problem
traveling salesman problem
graph model
combinatorial optimization problems
memetic algorithm
benchmark instances
machine learning