Two simulated annealing-based heuristics for the job shop scheduling problem.
Kathleen SteinhöfelAndreas Alexander AlbrechtChak-Kuen WongPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- job shop scheduling problem
- simulated annealing
- tabu search algorithm
- tabu search
- job shop scheduling
- benchmark problems
- critical path
- production scheduling
- metaheuristic
- genetic algorithm
- evolutionary algorithm
- combinatorial optimization
- heuristic methods
- solution quality
- genetic algorithm ga
- scheduling problem
- neighborhood search
- benchmark instances
- combinatorial optimization problems
- neural network
- search procedure
- particle swarm optimization
- search strategies
- feasible solution
- search algorithm
- heuristic search
- exact algorithms
- np hard
- differential evolution