Wasserstein Risk-Sensitive Appointment Scheduling Under Delay Constraints

Published Online:https://doi.org/10.1287/ijoc.2024.0782

References

  • Ahmadi-Javid A, Jalali Z, Klassen KJ (2017) Outpatient appointment systems in healthcare: A review of optimization studies. Eur. J. Oper. Res. 258(1):3–34.CrossrefGoogle Scholar
  • Artzner P, Delbaen F, Eber J, Heath D (1999) Coherent measures of risk. Math. Finance 9(3):203–228.CrossrefGoogle Scholar
  • Begen MA, Queyranne M (2011) Appointment scheduling with discrete random durations. Math. Oper. Res. 36(2):240–257.LinkGoogle Scholar
  • Benjaafar S, Chen D, Wang R, Yan Z (2023) Appointment scheduling under a service-level constraint. Manufacturing Service Oper. Management 25(1):70–87.LinkGoogle Scholar
  • Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer, Berlin).CrossrefGoogle Scholar
  • Cayirli T, Veral E (2003) Outpatient scheduling in health care: A review of literature. Production Oper. Management 12(4):519–549.CrossrefGoogle Scholar
  • Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with applicatin to data-driven problems. Oper. Res. 58(3):595–612.LinkGoogle Scholar
  • Dyer M, Stougie L (2006) Computational complexity of stochastic programming problems. Math. Programming 106(3):423–432.CrossrefGoogle Scholar
  • Esfahani PM, Kuhn D (2018) Data-driven distributional robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Programming 171(1):115–166.CrossrefGoogle Scholar
  • Föllmer H, Schied A (2004) Stochastic Finance: An Introduction in Discrete Time (Walter de Gruyter, Berlin).CrossrefGoogle Scholar
  • Fournier N, Guillin A (2015) On the rate of convergence in Wasserstein distance of the empirical measure. Probability Theory Related Fields 162(3):707–738.CrossrefGoogle Scholar
  • Gao R (2023) Finite-sample guarantees for Wasserstein distributionally robust optimization: Breaking the curse of dimensionality. Oper. Res. 71(6):2291–2306.LinkGoogle Scholar
  • Gao R, Kleywegt AJ (2023) Distributional robust stochastic optimization with Wasserstein distance. Math. Oper. Res. 48(2):603–655.LinkGoogle Scholar
  • Gao R, Chen X, Kleywegt AJ (2024) Wasserstein distributionally robust optimization and variation regularization. Oper. Res. 72(3):1177–1191.LinkGoogle Scholar
  • Ge D, Wan G, Wang Z, Zhang J (2014) A note on appointment scheduling with piecewise linear cost functions. Math. Oper. Res. 39(4):949–1348.LinkGoogle Scholar
  • Guo S, Xu H (2019) Distributionally robust shortfall risk optimization model and its approximation. Math. Programming 174(1):473–498.CrossrefGoogle Scholar
  • Hanasusanto GA, Kuhn D, Wiesemann W (2016) A comment on “computational complexity of stochastic programming problems. Math. Programming 159(1):557–569.CrossrefGoogle Scholar
  • Hanasusanto GA, Kuhn D, Wallace SW, Zymler S (2015) Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Math. Programming 152(1):1–32.CrossrefGoogle Scholar
  • Jiang R, Ryu M, Xu G (2019) Data-driven distributionally robust appointment scheduling over Wasserstein balls. Preprint, submitted July 2019, https://arxiv.org/abs/1907.03219v1.Google Scholar
  • Jiang R, Shen S, Zhang Y (2017) Integer programming approaches for appointment scheduling with random no-shows and service durations. Oper. Res. 65(6):1638–1656.LinkGoogle Scholar
  • Kantorovich LV, Rubinstein GS (1958) On a space of totally additive functions. Vestnik Leningrad University 13(7):52–59.Google Scholar
  • Klassen KJ, Yoogalingam R (2009) Improving performance in outpatient appointment services with a simulation optimization approach. Production Oper. Management 18(4):447–458.CrossrefGoogle Scholar
  • Kong QX, Lee CY, Teo CP, Zheng Z (2013) Scheduling arrivals to stochastic service delivery system using copositive cones. Oper. Res. 61(3):711–726.LinkGoogle Scholar
  • Kong QX, Li S, Liu N, Teo CP, Yan Z (2020) Appointment scheduling under time-dependent patient no-show behavior. Management Sci. 66(8):3480–3500.LinkGoogle Scholar
  • Kuhn D, Esfahani PM, Nguyen VA, Shafieezadeh-Abadeh S (2019) Wasserstein distributionally robust optimization: Theory and applications in machine learning. Netessine S, ed. Operations Research & Management Science in the Age of Analytics (INFORMS, Catonsville, MD), 130–166.Google Scholar
  • Mak HY, Rong Y, Zhang J (2015) Appointment scheduling with limited distributional information. Management Sci. 61(2):316–334.LinkGoogle Scholar
  • Mandelbaum A, Momcilovic P, Trichakis N, Kadish S, Leib R, Bunnell CA (2019) Data-driven appointment-scheduling under uncertainty: The case of an infusion unit in a cancer center. Management Sci. 66(1):243–270.LinkGoogle Scholar
  • Murota K, Shioura A (2014) Exact bounds for steepest descent algorithms of L-convex function minimization. Oper. Res. Lett. 42(5):361–366.CrossrefGoogle Scholar
  • Pang Z, Wang S, Zhao J (2026) Data for Wasserstein risk-sensitive appointment scheduling under delay constraints. https://doi.org/10.1287/ijoc.2024.0782.cd, https://github.com/INFORMSJoC/2024.0782.Google Scholar
  • Qi J (2017) Mitigating delays and unfairness in appointment systems. Management Sci. 63(2):566–583.LinkGoogle Scholar
  • Rachev GC (2007) Mass Transportation Problems, vol. 2 (Springer, Berlin).Google Scholar
  • Rockafellar RT, Uryasev SP (2000) Optimization of conditional value-at-risk. J. Risk 2(3):21–41.CrossrefGoogle Scholar
  • Shafieezadeh-Abadeh S, Kuhn D, Esfahani PM (2019) Regularization via mass transportation. J. Machine Learn. Res. 20(103):1–68.Google Scholar
  • Shapiro A, Dentcheva D, Ruszczynski A (2021) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).CrossrefGoogle Scholar
  • Villani C (2008) Optimal Transport: Old and New, vol. 338 (Springer, Berlin).Google Scholar
  • Wainwright MJ (2019) High-Dimensional Statistics: A Non-Asymptotic Viewpoint, vol. 48 (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Wang S, Li J, Ang M, Ng TS (2024) Appointment scheduling with delay tolerance heterogeneity. INFORMS J. Comput. 36(5):1201–1224.LinkGoogle Scholar
  • Yue MC, Kuhn D, Wiesemann W (2022) On linear optimization over Wasserstein balls. Math. Programming 195(1):1107–1122.CrossrefGoogle Scholar
  • Zhang Y, Shen S, Erdogan SA (2017) Distributionally robust appointment scheduling with moment-based ambiguity set. Oper. Res. Lett. 45(2):139–144.CrossrefGoogle Scholar
  • Zhang R, Han X, Wang R, Zhang J, Zhang Y (2023) Please don’t make me wait! Influence of customers’ waiting preference and no-show behavior on appointment systems. Production Oper. Management 32(6):1597–1616.CrossrefGoogle Scholar
  • Zhou M, Sim M, Lan SW (2022) Advance admission scheduling via resource satisficing. Production Oper. Management 31(11):4002–4020.CrossrefGoogle Scholar
  • Zhou Y, Parlar M, Verter V, Fraser S (2021) Surgical scheduling with constrained patient waiting times. Production Oper. Management 30(9):3253–3271.CrossrefGoogle Scholar
  • Zhu S, Fukushima M (2009) Worst-case conditional value-at-risk with application to robust portfolio management. Oper. Res. 57(5):1155–1168.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.