Variable neighborhood search for the pharmacy duty scheduling problem
From MaRDI portal
Publication:337137
DOI10.1016/j.cor.2014.06.001zbMath1348.90280OpenAlexW2095081037MaRDI QIDQ337137
Ö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 searchVNSPDSpharmacy duty schedulingvariable neighborhood decomposition searchvariable neighborhood restricted searchVNDSVNRS
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Portfolio decision analysis with a generalized balance approach ⋮ A branch and price algorithm for the pharmacy duty scheduling problem ⋮ Multiple traveling salesperson problem with drones: general variable neighborhood search approach ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ Pharmacy duty scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Variable neighborhood search for location routing
- A branch and price algorithm for the pharmacy duty scheduling problem
- Variable neighborhood search for harmonic means clustering
- The \(p\)-median problem: a survey of metaheuristic approaches
- An effective VNS for the capacitated \(p\)-median problem
- Variable neighborhood search for minimum cost berth allocation
- General variable neighborhood search for the continuous optimization
- A note on solving large p-median problems
- Cluster analysis and mathematical programming
- Variable neighborhood search
- Variable neighborhood tabu search and its application to the median cycle problem.
- An efficient genetic algorithm for the \(p\)-median problem
- Location science research: a review
- A taxonomy for emergency service station location problem
- Variable neighborhood decomposition search
- The parallel variable neighborhood search for the \(p\)-median problem
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- Variable neighbourhood search for bandwidth reduction
- A bibliography for some fundamental problem categories in discrete location science
- Algorithms of ant system and simulated annealing for the \(p\)-median problem
- Variable neighborhood search and local branching
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- 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
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood search for the p-median
- Emergency ambulance deployment in Barbados: a multi-objective approach
- Large neighborhood local search for the p-median problem
- Variable neighborhood search: Principles and applications
This page was built for publication: Variable neighborhood search for the pharmacy duty scheduling problem
