Pharmacy Duty Scheduling Problem: Gumushane Case

Abstract

In the Turkish Healthcare System, pharmacies are an important echelon of the drug supply chain. The pharmacy on duty practice ensures that the demand for drugs and similar medical supplies is met 24/7. The duty pharmacy scheduling problem aims to satisfy the customers and the pharmacists without violating the regulations while determining the duty sequence of the pharmacies in a certain planning period. This study handles the duty pharmacy scheduling problem of Gümüşhane City Center where 13 pharmacies operate. In the current system, the representative pharmacist prepares the duty schedule manually. The planning period is divided into subsets, and pharmacies are assigned to the duties in each subset respectively in such the number of duties of each pharmacy in the subsets is as equal as possible. The managerial problem of the case is that the duty frequency of each pharmacy is variable in the manual schedule and pharmacists perceive this as an unfairness. Because pharmacists expect to be on duty 1 in 13 days. We propose a mathematical model that adopts the fixed duty frequency and the inheritance of duty distribution. We test the model according to the 2020 calendar and compare model results with the real duty schedule belong to 2020 using the 2019 distribution of pharmacies. The comparison and test results show that the duties are distributed as fairly as possible and the turn of each pharmacy is repeated once every 13 days. The contribution of this study is that it introduces innovative components to the pharmacy duty scheduling problem, offers practical policy recommendations, and provides a case-specific example to limited PDS literature.

Keywords

• Pharmacy Duty Scheduling
• Integer Programming
• The Fixed Duty Frequency
• The Inheritance of Duty Distribution

References

1. J. R. Swisher, S. H. Jacobson, J. Jun and O. Balci, "Modeling and analyzing a physician clinic environment using discrete-event (visual) simulation," Computers & Operations Research, vol. 28, no. 2, pp. 105-125, 2001.
2. P. S. Varela, G. A. de Martins and L. P. L. Fávero, "Production efficiency and financing of public health: An analysis of small municipalities in the state of São Paulo- Brazil," Health Care Management Science, vol. 13, no. 2, pp. 112-123, 21 6 2010.
3. S. Kanuganti, A. K. Sarkar, A. P. Singh and S. S. Arkatkar, "Quantification of accessibility to health facilities in rural areas," Case Studies on Transport Policy, vol. 3, no. 3, pp. 311-320, 1 9 2015.
4. L. Jiang and R. E. Giachetti, "A queueing network model to analyze the impact of parallelization of care on patient cycle time," Health Care Management Science, vol. 11, no. 3, pp. 248-261, 9 2008.
5. I. Adan, J. Bekkers, N. Dellaert, J. Vissers and X. Yu, "Patient mix optimisation and stochastic resource requirements: A case study in cardiothoracic surgery planning," Health Care Management Science, vol. 12, no. 2, pp. 129-141, 4 6 2009.
6. J. O. Brunner, J. F. Bard and R. Kolisch, "Flexible shift scheduling of physicians," Health Care Management Science, vol. 12, no. 3, pp. 285-305, 7 2009.
7. W. Abo-Hamad and A. Arisha, "Simulation-based framework to improve patient experience in an emergency department," European Journal of Operational Research, vol. 224, no. 1, pp. 154-166, 1 1 2013.
8. M. Dursun, E. E. Karsak and M. A. Karadayi, "A fuzzy multi-criteria group decision making framework for evaluating health-care waste disposal alternatives," Expert Systems with Applications, vol. 38, no. 9, pp. 11453-11462, 1 9 2011.

9. C. Kahraman and Y. I. Topcu, Eds., Operations Research Applications in Health Care Management, vol. 262, Cham: Springer International Publishing, 2018.
10. S. Tüzün and Y. I. Topcu, "A taxonomy of operations research studies in healthcare management," in International Series in Operations Research and Management Science, vol. 262, Springer New York LLC, 2018, pp. 3-21.
11. F. Kocatürk and Ö. Özpeynirci, "Variable neighborhood search for the pharmacy duty scheduling problem," Computers and Operations Research, vol. 51, pp. 218-226, 1 11 2014.
12. Ö. Özpeynirci and E. Ağlamaz, "Pharmacy duty scheduling problem," International Transactions in Operational Research, vol. 23, no. 3, pp. 459-480, 1 5 2016.
13. G. Ceyhan and Ö. Özpeynirci, "A branch and price algorithm for the pharmacy duty scheduling problem," Computers and Operations Research, vol. 72, pp. 175-182, 1 8 2016.
14. A. Özgür, F. Nar, D. Esen, F. Özkan and E. Uygun, "Stochastic Optimization of Turn of Duty for Pharmacies," in International Symposium on Health Informatics and Bioinformatics (HIBIT), 2009.
15. N. Uncu, B. Bulğurcu and F. Kılıç, "Distance restricted maximal covering model for pharmacy duty scheduling problem," International Journal of Optimization and Control: Theories and Applications, vol. 8, no. 2, pp. 208-215, 1 6 2018.