Variable Neighbourhood Search: A case study for a highly-constrained workforce scheduling problem.
Kenneth N. ReidJingpeng LiJerry SwanAlistair McCormickGilbert OwusuPublished in: SSCI (2016)
Keyphrases
- highly constrained
- scheduling problem
- tabu search
- variable neighbourhood search
- metaheuristic
- flowshop
- single machine
- memetic algorithm
- simulated annealing
- feasible solution
- search procedure
- np hard
- job shop scheduling problem
- search algorithm
- heuristic methods
- processing times
- benchmark instances
- precedence constraints
- scatter search
- constrained problems
- genetic algorithm
- vehicle routing problem
- parallel machines
- solution quality
- max sat
- hybrid metaheuristic
- mathematical programming
- constraint satisfaction problems
- search methods
- lower bound
- hybrid algorithm