A distance based variable neighborhood search for parallel machine scheduling.
Andre Costa BatistaLucas S. BatistaPublished in: CIPLS (2014)
Keyphrases
- variable neighborhood search
- metaheuristic
- single machine scheduling problem
- setup times
- tabu search
- traveling salesman problem
- routing problem
- vehicle routing problem
- heuristic methods
- minimum spanning tree
- hybrid method
- benchmark instances
- simulated annealing
- path relinking
- processing times
- search procedure
- benchmark problems
- combinatorial optimization
- ant colony optimization
- optimization problems
- evolutionary algorithm
- solution quality
- scatter search
- knn