Parallel cooperative meta-heuristics on the computational grid.: A case study: the bi-objective Flow-Shop problem.
Nouredine MelabMohand-Said MezmazEl-Ghazali TalbiPublished in: Parallel Comput. (2006)
Keyphrases
- bi objective
- metaheuristic
- ant colony optimization
- flowshop
- tabu search
- makespan minimization
- computational grids
- scheduling problem
- optimization problems
- parallel machines
- simulated annealing
- combinatorial optimization problems
- efficient solutions
- processing times
- setup times
- genetic algorithm
- heuristic methods
- combinatorial optimization
- particle swarm optimization
- optimal solution
- search space
- hybrid algorithms
- vehicle routing problem
- multi objective
- hybrid algorithm
- benchmark instances
- job shop scheduling problem
- traveling salesman problem
- shared memory
- shortest path problem
- grid computing
- special case
- sequence dependent setup times
- memetic algorithm
- network design
- parallel computing
- nsga ii
- multi objective optimization
- variable neighborhood search
- scheduling algorithm
- feasible solution
- search procedure
- test problems
- reinforcement learning