A Hybrid Simulated Annealing for Job Shop Scheduling Problem.
Leonor Hernández-RamírezJuan Frausto SolísGuadalupe Castilla ValdezJuan Javier González BarbosaDavid Terán VillanuevaMaría Lucila Morales-RodríguezPublished in: Int. J. Comb. Optim. Probl. Informatics (2019)
Keyphrases
- job shop scheduling problem
- simulated annealing
- tabu search
- job shop scheduling
- benchmark problems
- critical path
- metaheuristic
- genetic algorithm
- production scheduling
- evolutionary algorithm
- combinatorial optimization
- genetic algorithm ga
- job shop
- benchmark instances
- solution quality
- tabu search algorithm
- test problems
- scheduling problem
- combinatorial optimization problems
- feasible solution
- threshold accepting
- memetic algorithm
- information retrieval
- optimization problems