Early Reservation for Follow-up Appointments in a Slotted-Service Queue.

Shall Follow-up Appointments Be Booked in Advance? Appointment systems are ubiquitous, especially in healthcare. By looking into a large data set with over 1.6 million appointments, we observe that many doctors booked a follow-up appointment at the end of their meeting with their patients. This strategy ensures that the patients would follow up but at the risk that the patient may not show up and the appointment ends being wasted. We develop a slotted-service queue model to study if and when such a strategy should be used in three representative appointment systems, respectively. In an open access system, it is optimal to never use this strategy. In a traditional appointment system that allows patients to book in advance, it is optimal to apply this strategy to some patients. While in a hybrid system with both walk-in patients and patients with appointments, whether to use this strategy depends on the load balancing between the two patient queues. We study an appointment-based slotted-service queue with the goal of maximizing service volume. Returning customers prefer to be served by the same service agent as in their previous visit. This model captures aspects of a whole host of settings, including medical clinics, law firms, and tutoring services. We consider a simple strategy that a service provider may use to reduce balking among returning customers—designate some returning customers as high-priority customers. These customers are placed at the head of the queue when they call for a follow-up appointment. In an appointment-based system, this policy can be implemented by booking a high-priority returning customer's appointment right before he or she leaves the service facility. We focus on a need-based policy in which the decision to prioritize some customers depends on their return probability. We analyze three systems: an open-access system, a traditional appointment system, and a carve-out system. We show that in an open-access system, the service provider should never prioritize returning customers in order to maximize the throughput rate. However, it is always optimal to prioritize some customers in a traditional appointment system. In the carve-out system, which may be modeled as a system with two parallel queues, the optimal policy varies depending on which queue is more congested. In the traditional system, we prove that the throughput rate is a quasi-concave function of the threshold under the assumption that returning customers see time averages. This allows service systems to determine optimal operating policies that are both easy to implement and provably optimal. History: This paper has been accepted for the Operations Research Special Issue on Behavioral Queueing Science. Funding: This work was supported by Fonds de Recherche du Québec-Société et Culture [Grant 295837], National Natural Science Foundation of China [Grant 72061127002, 71731009], and Natural Sciences and Engineering Research Council of Canada [Grant RGPIN 2019-05539]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/opre.2022.2299. [ABSTRACT FROM AUTHOR]