Appointment Scheduling with Delay Tolerance Heterogeneity

Shuming Wang (), Jun Li (), Marcus Ang () and Tsan Sheng Ng ()
Additional contact information
Shuming Wang: School of Economics and Management, University of Chinese Academy of Sciences, Beijing 100190, China; MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation, University of Chinese Academy of Sciences, Beijing 100190, China
Jun Li: Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 117576, Singapore
Marcus Ang: Lee Kong Chian School of Business, Singapore Management University, Singapore 178899, Singapore
Tsan Sheng Ng: Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 117576, Singapore

INFORMS Journal on Computing, 2024, vol. 36, issue 5, 1201-1224

Abstract: In this study, we investigate an appointment sequencing and scheduling problem with heterogeneous user delay tolerances under service time uncertainty. We aim to capture the delay tolerance effect with heterogeneity, in an operationally effective and computationally tractable fashion, for the appointment scheduling problem. To this end, we first propose a Tolerance-Aware Delay (TAD) index that incorporates explicitly the user tolerance information in delay evaluation. We show that the TAD index enjoys decision-theoretical rationale in terms of Tolerance sensitivity , monotonicity , and convexity and positive homogeneity , which enables it to incorporate the frequency and intensity of delays over the tolerance in a coherent manner. Specifically, the convexity of TAD index ensures a tractable modeling of the collective delay dissatisfaction in the appointment scheduling problem. Using the TAD index, we then develop an appointment model with known empirical service time distribution that minimizes the overall tolerance-aware delays of all users. We analyze the impact of delay tolerance on the sequence and schedule decisions and show that the resultant TAD appointment model can be reformulated as a mixed-integer linear program (MILP). Furthermore, we extend the TAD appointment model by considering service time ambiguity. In particular, we encode into the TAD index a moment ambiguity set and a Wasserstein ambiguity set, respectively. The former captures effectively the correlation among service times across positions and user types, whereas the latter captures directly the service time data information. We show that both of the resultant TAD models under ambiguity can be reformulated as polynomial-sized, mixed-integer conic programs (MICPs). Finally, we compare our TAD models with some existing counterpart approaches and the current practice using synthetic data and a case of real hospital data, respectively. Our results demonstrate the effectiveness of the TAD appointment models in capturing the user delay tolerance with heterogeneity and mitigating the worst-case delays.

Keywords: joint appointment sequencing and scheduling; delay tolerance; user heterogeneity; linear programming; ambiguity (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2023.0025 (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:orijoc:v:36:y:2024:i:5:p:1201-1224

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().