Variable Neighborhood Search for Integrated Planning and Scheduling.
Mário LeiteCláudio AlvesTelmo PintoPublished in: ICCSA (2) (2017)
Keyphrases
- variable neighborhood search
- tabu search
- metaheuristic
- scheduling problem
- traveling salesman problem
- heuristic methods
- vehicle routing problem
- hybrid method
- single machine scheduling problem
- benchmark instances
- routing problem
- job shop scheduling problem
- heuristic search
- minimum spanning tree
- genetic algorithm
- resource allocation
- path relinking
- search procedure
- scheduling algorithm
- single machine
- simulated annealing
- optimization problems
- upper bound
- multiple objectives
- parallel machines
- special case
- precedence constraints
- search space