Fast simulated annealing hybridized with quenching for solving job shop scheduling problem.
Kashif AkramKhurram KamalAlam ZebPublished in: Appl. Soft Comput. (2016)
Keyphrases
- job shop scheduling problem
- simulated annealing
- combinatorial optimization
- tabu search
- job shop scheduling
- benchmark problems
- critical path
- metaheuristic
- production scheduling
- genetic algorithm
- evolutionary algorithm
- solution quality
- genetic algorithm ga
- scheduling problem
- benchmark instances
- memetic algorithm
- combinatorial optimization problems
- job shop
- search procedure
- test problems
- traveling salesman problem
- hybrid algorithm
- branch and bound algorithm
- graph model
- feasible solution
- evolutionary computation
- optimization problems
- social networks
- artificial intelligence