Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search.
Diarmuid GrimesEmmanuel HebrardPublished in: INFORMS J. Comput. (2015)
Keyphrases
- job shop scheduling problem
- directed search
- job shop scheduling
- genetic algorithm
- combinatorial optimization
- critical path
- benchmark problems
- tabu search
- simulated annealing
- search algorithm
- scheduling problem
- production scheduling
- combinatorial optimization problems
- benchmark instances
- job shop
- memetic algorithm
- graph model
- metaheuristic
- tabu search algorithm
- evolutionary algorithm
- neural network
- search space
- test problems
- computational intelligence
- np hard