Variable Neighbourhood Search for the Quay Crane Scheduling Problem.
Christopher Expósito IzquierdoBelén Melián-BatistaJ. Marcos Moreno-VegaPublished in: ISDA (2011)
Keyphrases
- quay crane
- scheduling problem
- variable neighbourhood search
- tabu search
- single machine
- feasible solution
- np hard
- heuristic methods
- flowshop
- mathematical programming
- job shop scheduling problem
- memetic algorithm
- path relinking
- vehicle routing problem
- processing times
- constructive heuristic
- hybrid algorithm
- combinatorial optimization
- solution quality
- constraint propagation
- candidate list
- search procedure
- parallel machines
- hybrid metaheuristic
- precedence constraints
- linear programming
- benchmark instances
- variable neighborhood search
- np complete
- dynamic programming
- constraint satisfaction problems
- evolutionary algorithm