A branch and price algorithm for the pharmacy duty scheduling problem
From MaRDI portal
Publication:342397
DOI10.1016/j.cor.2016.02.007zbMath1349.90325OpenAlexW2287256299MaRDI QIDQ342397
Gökhan Ceyhan, Özgür Özpeynirci
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.02.007
Related Items (2)
Variable neighborhood search for the pharmacy duty scheduling problem ⋮ Multi-period technician scheduling with experience-based service times and stochastic customers
Cites Work
- Variable neighborhood search for the pharmacy duty scheduling problem
- The multi-period incremental service facility location problem
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Parallel Machine Scheduling by Column Generation
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Pharmacy duty scheduling problem
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
- Routing with time windows by column generation
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- The Multiperiod Location-Allocation Problem with Relocation of Facilities
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Solving Parallel Machine Scheduling Problems by Column Generation
- Selected Topics in Column Generation
- The Location of Emergency Service Facilities
This page was built for publication: A branch and price algorithm for the pharmacy duty scheduling problem
