Variable neighborhood search for the pharmacy duty scheduling problem.
Fatih KocatürkÖzgür ÖzpeynirciPublished in: Comput. Oper. Res. (2014)
Keyphrases
- variable neighborhood search
- scheduling problem
- tabu search
- total weighted tardiness
- metaheuristic
- path relinking
- benchmark instances
- flowshop
- single machine
- feasible solution
- heuristic methods
- simulated annealing
- np hard
- single machine scheduling problem
- memetic algorithm
- processing times
- job shop scheduling problem
- search procedure
- precedence constraints
- vehicle routing problem
- hybrid method
- traveling salesman problem
- parallel machines
- hybrid algorithm
- search algorithm
- genetic algorithm
- routing problem
- scatter search
- optimization problems
- sequence dependent setup times
- solution quality
- minimum spanning tree
- ant colony optimization