Solving the job-shop scheduling problem optimally by dynamic programming.
Joaquim A. S. GromichoJelke J. van HoornFrancisco Saldanha-da-GamaGerrit T. TimmerPublished in: Comput. Oper. Res. (2012)
Keyphrases
- job shop scheduling problem
- dynamic programming
- job shop scheduling
- combinatorial optimization
- critical path
- scheduling problem
- tabu search
- production scheduling
- combinatorial optimization problems
- genetic algorithm
- job shop
- simulated annealing
- benchmark problems
- single machine
- memetic algorithm
- benchmark instances
- tabu search algorithm
- graph model
- traveling salesman problem
- greedy algorithm
- branch and bound algorithm
- test problems
- genetic algorithm ga
- fitness function
- metaheuristic
- cost function
- evolutionary algorithm
- reinforcement learning