Intraday Scheduling with Patient Re-entries and Variability in Behaviours

Published Online:https://doi.org/10.1287/msom.2020.0959

References

  • Bandi C, Loke GG (2018) Exploiting hidden convexity for optimal flow control in queueing networks. Preprint, submitted June 5, https://dx.doi.org/10.2139/ssrn.3190874.Google Scholar
  • Bandi C, Bertsimas D, Youssef N (2015) Robust queueing theory. Oper. Res. 63(3):676–700.LinkGoogle Scholar
  • Berg BP, Denton BT, Ayca ES, Rohleder T, Huschka T (2014) Optimal booking and scheduling in outpatient procedure centers. Comput. Oper. Res. 50:24–37.CrossrefGoogle Scholar
  • Braverman A, Dai JG, Liu X, Ying L (2017) Fluid-model-based car routing for modern ridesharing systems. Performance Evaluation Rev. 44(1):11–12.CrossrefGoogle Scholar
  • Dai JG, Shi P (2017) A two-time-scale approach to time-varying queues in hospital inpatient flow management. Oper. Res. 65(2):514–536.LinkGoogle Scholar
  • Dai JG, Tezcan T (2011) State space collapse in many-server diffusion limits of parallel server systems. Math. Oper. Res. 36(2):271–320.LinkGoogle Scholar
  • Denton B, Gupta D (2003) A sequential bounding approach for optimal appointment scheduling. IIE Trans. 35(11):1003–1016.CrossrefGoogle Scholar
  • Denton B, Viapiano J, Vogl A (2007) Optimization of surgery sequencing and scheduling decisions under uncertainty. Health Care Management Sci. 10(1):13–24.CrossrefGoogle Scholar
  • Erdogan AS, Denton B (2013) Dynamic appointment scheduling of a stochastic server with uncertain demand. INFORMS J. Comput. 25(1):116–132.LinkGoogle Scholar
  • Feldman J, Liu N, Topaloglu H, Ziya S (2014) Appointment scheduling under patient preference and no-show behavior. Oper. Res. 62(4):794–811.LinkGoogle Scholar
  • Follmer H, Knispel T (2011) Entropic risk measures: Coherence vs. convexity, model ambiguity, and robust large deviations. Stochastics Dynam. 11(2):333–351.CrossrefGoogle Scholar
  • Follmer H, Schied A (2002) Convex measures of risk and trading constraints. Finance Stochastics 6:429–447.CrossrefGoogle 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):1244–1251.LinkGoogle Scholar
  • Gupta D (2007) Surgical suites’ operations management. Production Oper. Management 16(6):689–700.CrossrefGoogle Scholar
  • Gupta D, Denton B (2008) Appointment scheduling in healthcare: Challenges and opportunities. IIE Trans. 40(9):800–819.CrossrefGoogle Scholar
  • Gurvich I (2014) Diffusion models and steady-state approximations for exponentially ergodic Markovian queues. Ann. Appl. Probab. 24(6):2527–2559.CrossrefGoogle Scholar
  • Gurvich I, Luedtke J, Tezcan T (2010) Staffing call centers with uncertain demand forecasts: A chance-constrained optimization approach. Management Sci. 56(7):1093–1115.LinkGoogle Scholar
  • Hall NG, Long DZ, Qi J, Sim M (2015) Managing underperformance risk in project portfolio selection. Oper. Res. 63(3):660–675.LinkGoogle Scholar
  • Ho CJ, Lau HS (1992) Minimizing total cost in scheduling outpatient appointments. Management Sci. 38(12):1750–1764.LinkGoogle Scholar
  • Jaillet P, Qi J, Sim M (2016) Routing optimization under uncertainty. Oper. Res. 64(1):186–200.LinkGoogle 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
  • Kong Q, 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
  • Liu N, Ziya S, Kulkarni VG (2010) Dynamic scheduling of outpatient appointments under patient no-shows and cancellations. Manufacturing Service Oper. Management 12(2):347–364.LinkGoogle Scholar
  • Luo J, Kulkarni VG, Ziya S (2012) Appointment scheduling under patient no-shows and service interruptions. Manufacturing Service Oper. Management 14(4):670–684.LinkGoogle Scholar
  • Mak HY, Rong Y, Zhang J (2014) Sequencing appointments for service systems using inventory approximations. Manufacturing Service Oper. Management 16(2):251–262.LinkGoogle Scholar
  • Mak HY, Rong Y, Zhang J (2015) Appointment scheduling with limited distributional information. Management Sci. 61(2):316–334.LinkGoogle Scholar
  • Padmanabhan D, Natarajan K, Murthy K (2018) Exploiting partial correlations in distributionally robust optimization. Preprint, submitted November 13, https://ssrn.com/abstract=3270706, https://dx.doi.org/10.2139/ssrn.3270706.Google Scholar
  • Qi J (2017) Mitigating delays and unfairness in appointment systems. Management Sci. 63(2):566–583.LinkGoogle Scholar
  • Stein WE, Cote MJ (1994) Scheduling arrivals to a queue. Comput. Oper. Res. 21(6):607–614.CrossrefGoogle Scholar
  • Wang PP (1993) Static and dynamic scheduling of customer arrivals to a single-server system. Naval Res. Logist. 40(3):345–360.CrossrefGoogle Scholar
  • Wang X, Truong V-A, Bank D (2018) Online advance admission scheduling for services, with customer preferences. Preprint, submitted May 26, https://arxiv.org/abs/1805.10412v1.Google 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.