Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines.
Makram ZaidiBassem JarbouiImed KacemTaïcir LoukilPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- release times
- metaheuristic
- single machine
- completion times
- simulated annealing and tabu search
- scheduling problem
- greedy randomized adaptive search procedure
- tabu search
- optimization problems
- processing times
- simulated annealing
- combinatorial optimization
- combinatorial optimization problems
- search space
- ant colony optimization
- scatter search
- release dates
- particle swarm optimization
- search methods
- combinatorial problems
- genetic algorithm
- vehicle routing problem
- nature inspired
- optimal solution
- specific problems
- path relinking
- optimization method
- benchmark instances
- parallel machines
- flowshop
- swarm intelligence
- traveling salesman problem
- multi objective
- special case
- computational complexity
- set of benchmark instances