Instance space analysis and algorithm selection for the job shop scheduling problem.

Simon Strassl Nysret Musliu

Published in: Comput. Oper. Res. (2022)

Keyphrases

job shop scheduling problem
instance space
dynamic programming
simulated annealing
real valued
benchmark problems
learning algorithm
computational complexity
np hard
similarity measure
objective function
search space
domain knowledge
scheduling problem
worst case
knapsack problem