An Optimization-Based Scheduling Methodology for Appointment Systems with Heterogeneous Customers and Nonstationary Arrival Processes
- 1 November 2025
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (6) , 1624-1649
Abstract
In this paper, we analyze appointment systems involving heterogeneous customers, each requesting different services, with nonstationary arrival processes. The main goal is to identify server schedules that lead to good-performing systems, which we measure through the expected system time and the number of customer rejections. This decision problem arises in a number of applications and is especially relevant when certain service types dominate other service types. A key challenge in this analysis is the lack of closed-form analytical expressions that characterize the performance of the system. In this work, we construct a stylized optimization model based on a pointwise stationary approximation that emulates the original stochastic system. An analysis of the resulting stylized model comprised of a single customer type leads to key structural properties which we use to devise a globally convergent solution scheme that runs in polynomial time. This solution scheme is then generalized to the case of multiple customer types for two different formulations of the decision problem. To demonstrate the effectiveness of the proposed framework, we conduct a case study on Texas A&M University’s College and Psychological Services. Our results show that our optimal solutions substantially improve the performance of the system over current practices by reducing access time for critical mental health services by as much as 56%. Our analysis also identifies an easily implementable scheduling policy consisting of a single modification whose performance is within 10% of the more complex policies. History: Accepted by J. Paul Brooks, Area Editor for Applications in Biology, Medicine, & Healthcare. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0039 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0039 . The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .Keywords
This publication has 46 references indexed in Scilit:
- Dynamic appointment scheduling with wait-dependent abandonmentEuropean Journal of Operational Research, 2018
- Performance analysis of time-dependent queueing systems: Survey and classificationOmega, 2016
- STAFFING A SERVICE SYSTEM WITH NON-POISSON NON-STATIONARY ARRIVALSProbability in the Engineering and Informational Sciences, 2016
- Optimal server scheduling in nonpreemptive finite-population queueing systemsQueueing Systems, 2006
- Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policiesQueueing Systems, 1999
- Dynamic staffing in a telephone call center aiming to immediately answer all callsOperations Research Letters, 1999
- Combinatorial Optimization1997
- Diffusion approximation to a queueing system with time-dependent arrival and service ratesQueueing Systems, 1995
- Scheduling operating room surgical procedures with early and late completion penalty costsJournal of Operations Management, 1984
- A dual algorithm for the constrained shortest path problemNetworks, 1980