A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling.
Ahmed El-BouriNader AziziSaeed ZolfaghariPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- job shop scheduling
- simulated annealing
- job shop scheduling problem
- scheduling problem
- benchmark problems
- tabu search
- genetic algorithm
- combinatorial optimization problems
- metaheuristic
- evolutionary algorithm
- graph coloring
- genetic algorithm ga
- combinatorial optimization
- programming language
- memory requirements
- objective function
- artificial intelligence
- neural network