Variable neighborhood search for the pharmacy duty scheduling problem
DOI10.1016/J.COR.2014.06.001zbMATH Open1348.90280OpenAlexW2095081037MaRDI QIDQ337137FDOQ337137
Özgür Özpeynirci, Fatih Kocatürk
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.001
variable neighborhood searchPDSpharmacy duty schedulingvariable neighborhood decomposition searchvariable neighborhood restricted searchVNDSVNRSVNS
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- A note on solving large p-median problems
- TSPLIB—A Traveling Salesman Problem Library
- An efficient genetic algorithm for the \(p\)-median problem
- Cluster analysis and mathematical programming
- Variable neighborhood tabu search and its application to the median cycle problem.
- A bibliography for some fundamental problem categories in discrete location science
- The \(p\)-median problem: a survey of metaheuristic approaches
- Variable neighborhood search
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Variable neighborhood search: Principles and applications
- Variable neighborhood search for harmonic means clustering
- Algorithms of ant system and simulated annealing for the \(p\)-median problem
- Variable neighborhood search and local branching
- Variable neighborhood search for location routing
- Location science research: a review
- A taxonomy for emergency service station location problem
- Variable neighborhood decomposition search
- Variable neighborhood search for the p-median
- Variable neighborhood search for minimum cost berth allocation
- Variable neighbourhood search for bandwidth reduction
- General variable neighborhood search for the continuous optimization
- The parallel variable neighborhood search for the \(p\)-median problem
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- Variable neighborhood search method for optimizing the emergency service network of police special forces units
- Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
- A branch and price algorithm for the pharmacy duty scheduling problem
- Emergency ambulance deployment in Barbados: a multi-objective approach
- Large neighborhood local search for the p-median problem
- An effective VNS for the capacitated \(p\)-median problem
Cited In (6)
- Pharmacy duty scheduling problem
- Multiple traveling salesperson problem with drones: general variable neighborhood search approach
- A survey on the applications of variable neighborhood search algorithm in healthcare management
- Minimum common string partition: on solving large‐scale problem instances
- Portfolio decision analysis with a generalized balance approach
- A branch and price algorithm for the pharmacy duty scheduling problem
Uses Software
This page was built for publication: Variable neighborhood search for the pharmacy duty scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337137)
