Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search.
Yi QuTimothy CurtoisPublished in: ICORES (2020)
Keyphrases
- scheduling problem
- tabu search
- variable neighbourhood search
- single machine
- combinatorial optimization
- np hard
- simulated annealing
- feasible solution
- flowshop
- heuristic methods
- parallel machines
- job shop scheduling problem
- metaheuristic
- objective function
- multi objective
- precedence constraints
- computational complexity