Pharmacy duty scheduling problem

Pharmacy duty scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor201688
Volume: 23
Issue: 3
Start Page Number: 459
End Page Number: 480
Publication Date: May 2016
Journal: International Transactions in Operational Research
Authors: ,
Keywords: combinatorial optimization, heuristics: tabu search, programming: mathematical
Abstract:

In this study, we define the pharmacy duty scheduling problem, which requires a subset of pharmacies to be on duty on national holidays, at weekends, and at nights, in order to be able to satisfy the emergency medicine needs. We model the pharmacy duty scheduling problem as a multiperiod p‐median problem with special side constraints, and analyze the computational complexity. We propose a Tabu Search heuristic and develop lower bound (LB) algorithms. We test the performance of mathematical models, Tabu Search heuristic, and the LBs on randomly generated instances. We analyze the current system in İzmir, the third largest city in Turkey, with a population of 3.5 million, and apply solution methods. Our results show that the proposed Tabu Search algorithm suggests improvements on the current system.

Reviews

Required fields are marked *. Your email address will not be published.