TY - JOUR
T1 - Appointment scheduling under patient preference and no-show behavior
AU - Feldman, Jacob
AU - Liu, Nan
AU - Topaloglu, Huseyin
AU - Ziya, Serhan
PY - 2014
Y1 - 2014
N2 - Motivated by the rising popularity of electronic appointment booking systems, we develop appointment scheduling models that take into account the patient preferences regarding when they would like to be seen. The service provider dynamically decides which appointment days to make available for the patients. Patients arriving with appointment requests may choose one of the days offered to them or leave without an appointment. Patients with scheduled appointments may cancel or not show up for the service. The service provider collects a "revenue" from each patient who shows up and incurs a "service cost" that depends on the number of scheduled appointments. The objective is to maximize the expected net "profit" per day. We begin by developing a static model that does not consider the current state of the scheduled appointments. We give a characterization of the optimal policy under the static model and bound its optimality gap. Building on the static model, we develop a dynamic model that considers the current state of the scheduled appointments, and we propose a heuristic solution procedure. In our computational experiments, we test the performance of our models under the patient preferences estimated through a discrete choice experiment that we conduct in a large community health center. Our computational experiments reveal that the policies we propose perform well under a variety of conditions.
AB - Motivated by the rising popularity of electronic appointment booking systems, we develop appointment scheduling models that take into account the patient preferences regarding when they would like to be seen. The service provider dynamically decides which appointment days to make available for the patients. Patients arriving with appointment requests may choose one of the days offered to them or leave without an appointment. Patients with scheduled appointments may cancel or not show up for the service. The service provider collects a "revenue" from each patient who shows up and incurs a "service cost" that depends on the number of scheduled appointments. The objective is to maximize the expected net "profit" per day. We begin by developing a static model that does not consider the current state of the scheduled appointments. We give a characterization of the optimal policy under the static model and bound its optimality gap. Building on the static model, we develop a dynamic model that considers the current state of the scheduled appointments, and we propose a heuristic solution procedure. In our computational experiments, we test the performance of our models under the patient preferences estimated through a discrete choice experiment that we conduct in a large community health center. Our computational experiments reveal that the policies we propose perform well under a variety of conditions.
KW - Appointment scheduling
KW - Healthcare management
KW - Markov decision process
KW - Optimization
UR - https://www.scopus.com/pages/publications/84929331563
U2 - 10.1287/opre.2014.1286
DO - 10.1287/opre.2014.1286
M3 - Article
AN - SCOPUS:84929331563
SN - 0030-364X
VL - 62
SP - 794
EP - 811
JO - Operations Research
JF - Operations Research
IS - 4
ER -