Inpatient Overflow: An Approximate Dynamic Programming Approach

References

• Adelman D, Mersereau AJ (2008) Relaxations of weakly coupled stochastic dynamic programs. Oper. Res. 56(3):712–727.Link, Google Scholar
• Armony M, Israelit S, Mandelbaum A, Marmor Y, Tseytlin Y, Yom-Tov G (2015) Patient flow in hospitals: A data-based queueing perspective. Stochastic Systems 5(1):146–194.Link, Google Scholar
• Armony M, Ward AR (2010) Fair dynamic routing in large-scale heterogeneous-server systems. Oper. Res. 58(3):624–637.Link, Google Scholar
• Baron O, Berman O, Krass D, Wang J (2017) Strategic idleness and dynamic scheduling in an open-shop service network: Case study and analysis. Manufacturing Service Oper. Management 19(1):52–71.Link, Google Scholar
• Bell SL, Williams RJ (2005) Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy. Electronic J. Probab. 10(3):1044–1115.Crossref, Google Scholar
• Bertsekas DP (2012) Dynamic Programming and Optimal Control: Approximate Dynamic Programming, vol. II (Athena Scientific, Belmont, MA).Google Scholar
• Best TJ, Sandkç B, Eisenstein DD, Meltzer DO (2015) Managing hospital inpatient bed capacity through partitioning care into focused wings. Manufacturing Service Oper. Management 17(2):157–176.Link, Google Scholar
• Brown DB, Haugh MB (2017) Information relaxation bounds for infinite horizon Markov decision processes. Oper. Res. 65(5):1355–1379.Google Scholar
• Brown DB, Smith JE, Sun P (2010) Information relaxations and duality in stochastic dynamic programs. Oper. Res. 58(4):785–801.Link, Google Scholar
• Chan CW, Dong J, Green LV (2017) Queues with time-varying arrivals and inspections with applications to hospital discharge policies. Oper. Res. 65(2):469–495.Link, Google 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.Link, Google Scholar
• Dai JG, Shi P (2018) Online supplement for “Inpatient overflow: An approximate dynamic programming approach.” Working paper, Purdue University, West Lafayette, IN.Google Scholar
• Dai JG, Tezcan T (2008) Optimal control of parallel server systems with many servers in heavy traffic. Queueing Systems 59(2):95–134.Crossref, Google Scholar
• de Farias DP, Roy BV (2003) The linear programming approach to approximate dynamic programming. Oper. Res. 51(6):850–865.Link, Google Scholar
• Dong J, Perry O (2017) Queueing models for patient-flow dynamics in inpatient wards. Working paper, Columbia University, New York.Google 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.Link, Google Scholar
• Gesenway D (2010) Having problems finding your patients?. Accessed September 4, 2018, http://www.todayshospitalist.com/Having-problems-finding-your-patients/.Google Scholar
• Gurvich I, Whitt W (2009a) Queue-and-idleness-ratio controls in many-server service systems. Math. Oper. Res. 34(2):363–396.Link, Google Scholar
• Gurvich I, Whitt W (2009b) Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing Service Oper. Management 11(2):237–253.Link, Google Scholar
• Gurvich I, Whitt W (2010) Service-level differentiation in many-server service systems via queue-ratio routing. Oper. Res. 58(2):316–328.Link, Google Scholar
• Han S, He S, Oh HC (2016) Models for hospital inpatient operations: A data driven optimization approach for reducing ED boarding times. Presentation at INFORMS 2016 (INFORMS, Catonsville, MD).Google Scholar
• He S, Sim M, Zhang M (2019) Data-driven patient scheduling in emergency departments: A hybrid robust-stochastic approach. Management Sci., ePub ahead of print May 1, https://doi.org/10.1287/mnsc.2018.3145.Google Scholar
• Helm JE, Oyen MPV (2014) Design and optimization methods for elective hospital admissions. Oper. Res. 62(6):1265–1282.Link, Google Scholar
• Hoot NR, Aronsky D (2008) Systematic review of emergency department crowding: Causes, effects, and solutions. Ann Emerg Med 52(2):126–136.Crossref, Google Scholar
• Huang J, Carmeli B, Mandelbaum A (2015) Control of patient flow in emergency departments, or multiclass queues with deadlines and feedback. Oper. Res. 63(4):892–908.Link, Google Scholar
• Huang Q, Thind A, Dreyer J, Zaric G (2010) The impact of delays to admission from the emergency department on inpatient outcomes. BMC Emergency Medicine 10(1):16.Crossref, Google Scholar
• Khademi A, Saure DR, Schaefer AJ, Braithwaite RS, Roberts MS (2015) The price of nonabandonment: HIV in resource-limited settings. Manufacturing Service Oper. Management 17(4):554–570.Link, Google Scholar
• Kilinc D, Saghafian S, Traub SJ (2016) Dynamic assignment of patients to primary and secondary inpatient units: Is patience a virtue. Working paper, Harvard University, Cambridge, MA.Google Scholar
• Koole G, Pot A (2005) Approximate dynamic programming in multi-skill call centers. Proc. Winter Simulation Conf. (IEEE, New York).Crossref, Google Scholar
• Mandelbaum A, Momcilovic P, Tseytlin Y (2012) On fair routing from emergency departments to hospital wards: QED queues with heterogeneous servers. Management Sci. 58(7):1273–1291.Link, Google Scholar
• Maxwell MS, Henderson SG, Topaloglu H (2013) Tuning approximate dynamic programming policies for ambulance redeployment via direct search. Stochastics Systems 3(2):322–361.Link, Google Scholar
• Maxwell MS, Restrepo M, Henderson SG, Topaloglu H (2010) Approximate dynamic programming for ambulance redeployment. INFORMS J. Comput. 22(2):266–281.Link, Google Scholar
• Meyn SP (2000) Feedback regulation for sequencing and routing in multiclass queueing networks. SIAM J. Control Optim. 40(3):741–776Crossref, Google Scholar
• Moallemi CC, Kumar S, Roy BV (2008) Approximate and data-driven dynamic programming for queueing networks. Working paper, Stanford University, Stanford, CA.Google Scholar
• National University Hospital (2011) BMU Training Guide: Inpatient Operations (National University Hospital Inpatient Department, Singapore).Google Scholar
• Pang G, Yao DD (2018) Heavy-traffic limits for a many-server queueing network with switchover. Adv. Appl. Probab. 45(3):645–672.Crossref, Google Scholar
• Park E, Ding Y, Nagarajan M, Grafstein E (2019) Patient prioritization in emergency department triage systems: An empirical study of Canadian triage and acuity scale (CTAS). Manufacturing Service Oper. Management, ePub ahead of print April 8, https://doi.org/10.1287/msom.2018.0719.Google Scholar
• Perry O, Whitt W (2009) Responding to unexpected overloads in large-scale service systems. Management Sci. 55(8):1353–1367.Link, Google Scholar
• Perry O, Whittv W (2011a) A fluid approximation for service systems responding to unexpected overloads. Oper. Res. 59(5):1159–1170.Link, Google Scholar
• Perry O, Whitt W (2011b) An ODE for an overloaded X model involving a stochastic averaging principle. Stochastics Systems 1(1):59–108.Link, Google Scholar
• Pines JM, Batt RJ, Hilton JA, Terwiesch C (2011) The financial consequences of lost demand and reducing boarding in hospital emergency departments. Ann. Emergency Medicine 58(4):331–340.Crossref, Google Scholar
• Powell ES, Khare RK, Venkatesh AK, Roo BDV, Adams JG, Reinhardt G (2011) The relationship between inpatient discharge timing and emergency department boarding. J. Emergency Medicine 42(2):186–196.Crossref, Google Scholar
• Powell WB (2011) Approximate Dynamic Programming: Solving the Curses of Dimensionality. Wiley Series in Probability and Statistics (Wiley-Interscience, Hoboken, NJ).Crossref, Google Scholar
• Puterman ML (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley, New York).Crossref, Google Scholar
• Rabin E, Kocher K, McClelland M, Pines J, Hwang U, Rathlev N, Asplin B, Trueger NS, Weber E (2012) Solutions to emergency department ‘boarding’ and crowding are underused and may need to be legislated. Health Affairs 31(8):1757–1766.Crossref, Google Scholar
• Roubos D, Bhulai S (2010) Approximate dynamic programming techniques for the control of time-varying queuing systems applied to call centers with abandonments and retrials. Probab. Engrg. Inform. Sci. 24(1):27–45.Crossref, Google Scholar
• Samiedaluie S, Kucukyazici B, Verter V, Zhang D (2017) Managing patient admissions in a neurology ward. Oper. Res. 65(3):635–656.Link, Google Scholar
• Shi P, Chou MC, Dai JG, Ding D, Sim J (2016) Models and insights for hospital inpatient operations: Time-dependent ED boarding time. Management Sci. 62(1):1–28.Link, Google Scholar
• Shi P, Dai JG, Ding D, (James) Ang SK, Chou M, Jin X, Sim J (2014) Patient flow from emergency department to inpatient wards: Empirical observations from a Singaporean hospital. Working paper, Purdue University, West Lafayette, IN.Google Scholar
• Singer AJ, Jr. Thode HC, Viccellio P, Pines JM (2011) The association between length of emergency department boarding and mortality. Academic Emergency Medicine 18(12):1324–1329.Crossref, Google Scholar
• Song H, Tucker A, Graue R, Moravick S, Yang J (2018) Capacity pooling in hospitals: The hidden consequences of off-service placement. Working paper, University of Pennsylvania, Philadelphia.Google Scholar
• Stolyar AL, Tezcan T (2010) Control of systems with flexible multi-server pools: A shadow routing approach. Queueing Systems 66(1):1–51.Crossref, Google Scholar
• Stolyar AL, Tezcan T (2011) Shadow-routing based control of flexible multiserver pools in overload. Oper. Res. 59(6):1427–1444.Link, Google Scholar
• Sutton RS (1988) Learning to predict by the methods of temporal differences. Machine Learn 3(1):9–44.Crossref, Google Scholar
• Teow K, El-Darzi E, Foo C, Jin X, Sim J (2011) Intelligent analysis of acute bed overflow in a tertiary hospital in Singapore. J. Medical Systems 36(3):1873–1882.Crossref, Google Scholar
• Tezcan T, Dai JG (2010) Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. 58(1):94–110.Link, Google Scholar
• Thompson S, Nunez M, Garfinkel R, Dean MD (2009) Efficient short-term allocation and reallocation of patients to floors of a hospital during demand surges. Oper. Res. 57(2):261–273.Link, Google Scholar
• Veatch MH (2005) Approximate dynamic programming for networks: Fluid models and constraint reduction. Working paper, Gordon College, Wenham, MA.Google Scholar
• Watkins CJCH, Dayan P (1992) Technical note: Q-learning. Machine Learn. 8(3):279–292.Crossref, Google Scholar