Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
A branch and price algorithm for the pharmacy duty scheduling problem
Date
2016-08-01
Author
Ceyhan, Gokhan
ÖZPEYNİRCİ, NAİL ÖZGÜR
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
7
views
0
downloads
Cite This
Pharmacy Duty Scheduling (PDS) is the activity of assigning pharmacies to days during a planning horizon with the purpose of serving society outside regular working hours. In Turkey, pharmacies are retailers who operate during the working hours in weekdays. However, demand for medicine at nights, at the weekends and on holidays must be satisfied by allocating times to pharmacies to open at these times. The problem is a multi-period p-median problem with the additional problem specific constraints, and it is NP-Hard. In this study, we develop a branch-and-price algorithm to solve the PDS to optimality. We decompose the problem into single period problems and apply column generation on the decomposed problem. We propose several enhancements on the algorithm and conduct computational tests on randomly generated instances to compare the performance of the developed algorithm with the state-of art general purpose solver. The branch-and-price algorithm outperforms the state-of-art general purpose solver.
Subject Keywords
Management Science and Operations Research
,
Modelling and Simulation
,
General Computer Science
URI
https://hdl.handle.net/11511/65348
Journal
COMPUTERS & OPERATIONS RESEARCH
DOI
https://doi.org/10.1016/j.cor.2016.02.007
Collections
Department of Industrial Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
G. Ceyhan and N. Ö. ÖZPEYNİRCİ, “A branch and price algorithm for the pharmacy duty scheduling problem,”
COMPUTERS & OPERATIONS RESEARCH
, vol. 72, pp. 175–182, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65348.