Pharmacy duty scheduling problem
From MaRDI portal
Publication:2811939
DOI10.1111/itor.12204zbMath1338.90179OpenAlexW1831233558MaRDI QIDQ2811939
Özgür Özpeynirci, Ebru Ağlamaz
Publication date: 9 June 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12204
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items (2)
Optimal shift partitioning of pharmacies ⋮ A branch and price algorithm for the pharmacy duty scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available
- Variable neighborhood search for the pharmacy duty scheduling problem
- Genetic tabu search for the fuzzy flexible job shop problem
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
- The \(p\)-median problem: a survey of metaheuristic approaches
- An efficient tabu search procedure for the \(p\)-median problem
- A tabu search approach to the uncapacitated facility location problem
- A tabu search algorithm for the vehicle routing problem
- Neighborhood search heuristics for the uncapacitated facility location problem
- 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 statistical analysis of simulated annealing applied to the \(p\)-median problem
- A taxonomy for emergency service station location problem
- An aggregation heuristic for large scale p-median problem
- Ambulance location and relocation models.
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- A bibliography for some fundamental problem categories in discrete location science
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Algorithms of ant system and simulated annealing for the \(p\)-median problem
- Scheduling flexible manufacturing cells using Tabu Search
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Fifty years of operational research and emergency response
- Capacity and tool allocation problem in flexible manufacturing systems
- A tabu search procedure for coordinating production, inventory and distribution routing problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Tabu Search—Part I
- Tabu Search—Part II
- Variable neighborhood search for the p-median
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo
- Dynamic location problem under uncertainty with a regret‐based measure of robustness
- The Location of Emergency Service Facilities
This page was built for publication: Pharmacy duty scheduling problem
