Variable neighborhood search for the pharmacy duty scheduling problem

DOI10.1016/J.COR.2014.06.001MaRDI QIDQ337137zbMATH OpenOpenAlexFDO

Authors Fatih Kocatürk, Özgür Özpeynirci

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

zbMATH Keywords

variable neighborhood searchPDSpharmacy duty schedulingvariable neighborhood decomposition searchvariable neighborhood restricted searchVNDSVNRSVNS

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Pharmacy duty scheduling problem
• A branch and price algorithm for the pharmacy duty scheduling problem
• Variable neighborhood decomposition search
• Variable Neighborhood Search
• Variable neighborhood search: Principles and applications

Cites work

• A bibliography for some fundamental problem categories in discrete location science
• A branch and price algorithm for the pharmacy duty scheduling problem
• A note on solving large p-median problems
• A taxonomy for emergency service station location problem
• A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An effective VNS for the capacitated \(p\)-median problem
• An efficient genetic algorithm for the \(p\)-median problem
• Cluster analysis and mathematical programming
• Emergency ambulance deployment in Barbados: a multi-objective approach
• General variable neighborhood search for the continuous optimization
• Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
• Large neighborhood local search for the p-median problem
• Location science research: a review
• TSPLIB—A Traveling Salesman Problem Library
• The \(p\)-median problem: a survey of metaheuristic approaches
• The parallel variable neighborhood search for the \(p\)-median problem
• Variable neighborhood decomposition search
• Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem
• Variable neighborhood search
• Variable neighborhood search and local branching
• Variable neighborhood search for harmonic means clustering
• Variable neighborhood search for location routing
• Variable neighborhood search for minimum cost berth allocation
• Variable neighborhood search for the p-median
• Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
• Variable neighborhood search method for optimizing the emergency service network of police special forces units
• Variable neighborhood search: Principles and applications
• Variable neighborhood tabu search and its application to the median cycle problem.
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• Variable neighbourhood search for bandwidth reduction

Cited in

(7)

• Pharmacy duty scheduling problem
• A survey on the applications of variable neighborhood search algorithm in healthcare management
• Multiple traveling salesperson problem with drones: general variable neighborhood search approach
• Minimum common string partition: on solving large‐scale problem instances
• Portfolio decision analysis with a generalized balance approach
• Optimal shift partitioning of pharmacies
• A branch and price algorithm for the pharmacy duty scheduling problem

Describes a project that uses

Uses Software

• OR-Library
• TSPLIB
• GLOB

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)