A branch and price algorithm for the pharmacy duty scheduling problem
From MaRDI portal
(Redirected from Publication:342397)
Recommendations
- Variable neighborhood search for the pharmacy duty scheduling problem
- A rotation-based branch-and-price approach for the nurse scheduling problem
- Pharmacy duty scheduling problem
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
- Optimal shift partitioning of pharmacies
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- Branch-and-price approaches for the multiperiod technician routing and scheduling problem
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
Cites work
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Branch-and-price: Column generation for solving huge integer programs
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
- Parallel machine scheduling by column generation
- Pharmacy duty scheduling problem
- Routing with time windows by column generation
- Selected Topics in Column Generation
- Solving Parallel Machine Scheduling Problems by Column Generation
- The Location of Emergency Service Facilities
- The Multiperiod Location-Allocation Problem with Relocation of Facilities
- The multi-period incremental service facility location problem
- Variable neighborhood search for the pharmacy duty scheduling problem
Cited in
(5)- Pharmacy duty scheduling problem
- Multi-period technician scheduling with experience-based service times and stochastic customers
- Optimal shift partitioning of pharmacies
- Variable neighborhood search for the pharmacy duty scheduling problem
- Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems
This page was built for publication: A branch and price algorithm 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 Q342397)