A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem.
Matthias PrandtstetterUlrike RitzingerPeter SchmidtMario RuthmairPublished in: EvoCOP (2015)
Keyphrases
- variable neighborhood search
- tabu search
- scheduling problem
- total weighted tardiness
- single machine
- metaheuristic
- benchmark instances
- heuristic methods
- path relinking
- flowshop
- vehicle routing problem
- job shop scheduling problem
- feasible solution
- processing times
- single machine scheduling problem
- memetic algorithm
- simulated annealing
- traveling salesman problem
- np hard
- precedence constraints
- routing problem
- search procedure
- parallel machines
- hybrid algorithm
- minimum spanning tree
- hybrid method
- genetic algorithm
- scatter search
- search algorithm
- upper bound
- search space
- sequence dependent setup times