A branch and price algorithm for the pharmacy duty scheduling problem.
Gökhan CeyhanÖzgür ÖzpeynirciPublished in: Comput. Oper. Res. (2016)
Keyphrases
- np hard
- scheduling problem
- dynamic programming
- computational complexity
- matching algorithm
- computationally efficient
- experimental evaluation
- recognition algorithm
- theoretical analysis
- input data
- linear programming
- similarity measure
- optimization algorithm
- high accuracy
- worst case
- computational cost
- cost function
- search space
- simulated annealing
- learning algorithm
- k means
- detection algorithm
- preprocessing
- improved algorithm
- probabilistic model
- single machine
- convex hull
- times faster
- ant colony optimization
- lower bound
- segmentation algorithm
- particle swarm optimization
- significant improvement