Parallel Simulated Annealing for the Job Shop Scheduling Problem.
Wojciech BozejkoJaroslaw PemperaCzeslaw SmutnickiPublished in: ICCS (1) (2009)
Keyphrases
- job shop scheduling problem
- simulated annealing
- tabu search
- job shop scheduling
- benchmark problems
- critical path
- genetic algorithm
- production scheduling
- metaheuristic
- evolutionary algorithm
- combinatorial optimization
- job shop
- benchmark instances
- genetic algorithm ga
- memetic algorithm
- tabu search algorithm
- solution quality
- parallel computing
- combinatorial optimization problems
- shared memory
- ant colony optimization
- neighborhood search
- multi objective
- vehicle routing problem
- cost function