Appointment Scheduling Under a Service-Level Constraint

Saif Benjaafar (), David Chen (), Rowan Wang () and Zhenzhen Yan ()
Additional contact information
Saif Benjaafar: Department of Industrial and Systems Engineering, University of Minnesota, Minneapolis, Minnesota 55455
David Chen: School of Management and Economics, The Chinese University of Hong Kong, Shenzhen, Shenzhen 518172, China
Rowan Wang: Department of Information Systems and Management Engineering, Southern University of Science and Technology, Shenzhen, Shenzhen 518055, China
Zhenzhen Yan: School of Physical and Mathematical Sciences, Nanyang Technological University, 639798 Singapore, Singapore

Manufacturing & Service Operations Management, 2023, vol. 25, issue 1, 70-87

Abstract: Problem definition : This paper studies an appointment system where a finite number of customers are scheduled to arrive in such a way that (1) the expected waiting time of each individual customer cannot exceed a given threshold; and (2) the appointment times are set as early as possible (without breaking the waiting time constraint). Methodology/results : First, we show that, under the service-level constraint, a prospective schedule can be obtained from a sequential scheduling approach. In particular, we can schedule the appointment time of the next customer based on the scheduled appointment times of the previous customers. Then, we use a transient queueing-analysis approach and apply the theory of majorization to analytically characterize the structure of the optimal appointment schedule. We prove that, to keep the expected waiting time of each customer below a certain threshold, the minimum inter-appointment time required increases with the arrival sequence. We further identify additional properties of the optimal schedule. For example, a later arrival has a higher chance of finding an empty system and is more likely to wait less than the duration of his expected service time. We show the convergence of the service-level-constrained system to the D/M/1 queueing system as the number of arrivals approaches infinity and propose a simple, yet practical, heuristic schedule that is asymptotically optimal. We also develop algorithms that can help system managers determine the number of customers that can be scheduled in a fixed time window. We compare the service-level-constrained appointment system with other widely studied systems (including the equal-space and cost-minimization systems). We show that the service-level-constrained system leads to a lower upper bound on each customer’s waiting time; ensures a fair waiting experience among customers; and performs quite well in terms of system overtime. Finally, we investigate various extended settings of our analysis, including customer no-shows; mixed Erlang service times; multiple servers; and probability-based service-level constraints. Managerial implications : Our results provide guidelines on how to design appointment schedules with individual service-level constraints. Such a design ensures fairness and incorporates the threshold-type waiting perception of customers. It is also free from cost estimation and can be easily applied in practice. In addition, under the service-level-constrained appointment system, customers with later appointment times can have better waiting experiences, in contrast to the situation under other commonly studied systems.

Keywords: appointment scheduling; service-level constraint; waiting time; majorization (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/msom.2022.1159 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormsom:v:25:y:2023:i:1:p:70-87

Access Statistics for this article

More articles in Manufacturing & Service Operations Management from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().