Dynamic Home Care Routing and Scheduling with Uncertain Number of Visits per Referral

Published Online:https://doi.org/10.1287/trsc.2023.0120

References

  • Adelman D (2004) A price-directed approach to stochastic inventory/routing. Oper. Res. 52(4):499–514.LinkGoogle Scholar
  • Angelelli E, Bianchessi N, Mansini R, Speranza MG (2009) Short term strategies for a dynamic multi-period routing problem. Transportation Res. Part C Emerging Tech. 17(2):106–119.CrossrefGoogle Scholar
  • Bennett AR, Erera AL (2011) Dynamic periodic fixed appointment scheduling for home health. IIE Trans. Healthcare Systems Engrg. 1(1):6–19.CrossrefGoogle Scholar
  • Campbell AM, Wilson JH (2014) Forty years of periodic vehicle routing. Networks 63(1):2–15.CrossrefGoogle Scholar
  • Cappanera P, Scutellà MG, Nervi F, Galli L (2018) Demand uncertainty in robust Home Care optimization. Omega 80:95–110.CrossrefGoogle Scholar
  • Cire AA, Diamant A (2022) Dynamic scheduling of home care patients to medical providers. Production Oper. Management 31(11):4038–4056.CrossrefGoogle Scholar
  • De Farias D, Van Roy B (2003) The linear programming approach to approximate dynamic programming. Oper. Res. 51(6):850–865.LinkGoogle Scholar
  • Demirbilek M, Branke J, Strauss A (2019) Dynamically accepting and scheduling patients for home healthcare. Health Care Management Sci. 22(1):140–155.CrossrefGoogle Scholar
  • Demirbilek M, Branke J, Strauss AK (2021) Home healthcare routing and scheduling of multiple nurses in a dynamic environment. Flexible Services Manufacturing J. 33(1):253–280.CrossrefGoogle Scholar
  • Ferrari S, Villafañe JH, Berjano P, Vanti C, Monticone M (2018) How many physical therapy sessions are required to reach a good outcome in symptomatic lumbar spondylolisthesis? A retrospective study. J. Bodywork Movement Therapies 22(1):18–23.CrossrefGoogle Scholar
  • Fikar C, Hirsch P (2017) Home healthcare routing and scheduling: A review. Comput. Oper. Res. 77:86–95.CrossrefGoogle Scholar
  • Haggerty J, Reid R, Freeman G, Starfield B, Adair C, McKendry R (2003) Continuity of care: A multidisciplinary review. BMJ 327(7425):1219–1221.CrossrefGoogle Scholar
  • Heching A, Hooker JN, Kimura R (2019) A logic-based Benders approach to home healthcare delivery. Transportation Sci. 53(2):510–522.LinkGoogle Scholar
  • Klapp MA, Erera AL, Toriello A (2016) The one-dimensional dynamic dispatch waves problem. Transportation Sci. 52(2):402–415.LinkGoogle Scholar
  • Nickel S, Schröder M, Steeg J (2012) Mid-term and short-term planning support for home healthcare services. Eur. J. Oper. Res. 219(3):574–587.CrossrefGoogle Scholar
  • Patrick J, Puterman ML, Queyranne M (2008) Dynamic multipriority patient scheduling for a diagnostic resource. Oper. Res. 56(6):1507–1525.LinkGoogle Scholar
  • Puterman ML (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley & Sons, Inc., Hoboken, NJ).CrossrefGoogle Scholar
  • Rodríguez-Martín I, Salazar-González JJ, Yaman H (2019) The periodic vehicle routing problem with driver consistency. Eur. J. Oper. Res. 273(2):575–584.CrossrefGoogle Scholar
  • Rothenbächer AK (2019) Branch-and-price-and-cut for the periodic vehicle routing problem with flexible schedule structures. Transportation Sci. 53(3):850–866.Google Scholar
  • Sauré A, Patrick J, Tyldesley S, Puterman ML (2012) Dynamic multi-appointment patient scheduling for radiation therapy. Eur. J. Oper. Res. 223(2):573–584.CrossrefGoogle Scholar
  • Sawik T (2000) Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Math. Comput. Model. 31(13):39–52.CrossrefGoogle Scholar
  • Schedl M, Strauss C (2011) A periodic routing problem with stochastic demands. Proc. 2011 Internat. Conf. Complex Intelligent Software Intensive Systems (CISIS) (IEEE, Piscataway, NJ), 350–357.Google Scholar
  • Schweitzer PJ, Seidmann A (1985) Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. 110(2):568–582.CrossrefGoogle Scholar
  • Tong C, Topaloglu H (2014) On the approximate linear programming approach for network revenue management problems. INFORMS J. Comput. 26(1):121–134.LinkGoogle Scholar
  • Ulmer MW, Soeffker N, Mattfeld DC (2018) Value function approximation for dynamic multi-period vehicle routing. Eur. J. Oper. Res. 269(3):883–899.CrossrefGoogle Scholar
  • Ulmer M, Goodson J, Mattfeld D, Hennig M (2019) Offline–online approximate dynamic programming for dynamic vehicle routing with stochastic requests. Transportation Sci. 53(1):185–202.LinkGoogle Scholar
  • Vossen T, Zhang D (2015) Reductions of approximate linear programs for network revenue management. Oper. Res. 63(6):1352–1371.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.