PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 14, 2026INFORMS journal on computing0 citations

Wasserstein Risk-Sensitive Appointment Scheduling Under Delay Constraints

View Full Paper
ZPZhan Xi PangSWShuming WangJZJun Zhao

Key Points

  • To develop a risk-sensitive appointment scheduling model that manages patient delays while considering service-duration uncertainties.
  • Applied conditional value-at-risk (CVaR) to assess risk.
  • Developed a distributionally robust optimization (DRO) model within a Wasserstein ball framework.
  • Formulated and solved a regularized risk model for effective delay management.
  • Extended the model to handle multiple patient types using mixed-integer linear programming.
  • The proposed Wasserstein DRO model provided valuable operational insights for managing delays.
  • Achieved efficient optimal scheduling through empirical CVAR evaluations with binary search.
  • Demonstrated improved scheduling performance through numerical experiments, validating the approach.

Abstract

We consider a risk-averse appointment scheduling problem for a healthcare service delivery system with discrete appointment times and service-duration ambiguity, focusing on the tradeoff between overtime work and patient delays. We employ conditional value-at-risk (CVaR) to measure the risk, and to address the ambiguity, we develop a distributionally robust optimization (DRO) model over a type-1 Wasserstein ball centered at an empirical service-duration distribution. We show that the Wasserstein DRO model enjoys a regularized reformulation, which captures an empirical-risk effect and a position-differentiated effect on synthesized aversion to risk and ambiguity. The regularized reformulation provides an important operational insight of position-differentiated robustness for delay management under service-duration ambiguity, without incurring additional complexity. Leveraging the regularized reformulations, the optimal schedule can be determined efficiently by evaluating the empirical CVaRs with binary search for each position sequentially. We then perform sensitivity analysis and derive finite-sample and asymptotic performance guarantees for the obtained optimal schedule. Furthermore, we extend our model to incorporate sequencing decisions for multiple types of patients, which also exploits the regularization structure and can be solved as one instance of mixed-integer linear program. Finally, numerical experiments demonstrate the insights and performance of the proposed approach. History: Accepted by J. Paul Brooks, Area Editor for Applications in Biology, Medicine, & Healthcare. Funding: S. Wang is supported by the National Natural Science Foundation of China Grants 72471224, 72171221, 71922020, and 71988101, the Fundamental Research Funds for the Central Universities Grant UCAS-E2ET0808X2, and a grant from the Ministry of Education (MOE) Social Science Laboratory of Digital Economic Forecasts and Policy Simulation at University of Chinese Academy of Sciences. 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.2024.0782 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0782 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Pang et al. (2026) studied this question.

synapsesocial.com/papers/69b4fc44b39f7826a300cf74https://doi.org/10.1287/ijoc.2024.0782
Ask AI
Helpful
Bookmark
Share
View Full Paper