Optimal Routing Under Demand Surges: The Value of Future Arrival Rates

Published Online:https://doi.org/10.1287/opre.2022.0282

References

  • Akşin Z, Karaesmen F (2007) Characterizing the performance of process flexibility structures. Oper. Res. Lett. 35(4):477–484.CrossrefGoogle Scholar
  • Aksin Z, Armony M, Mehrotra V (2007) The modern call center: A multi-disciplinary perspective on operations management research. Production Oper. Management 16(6):665–688.CrossrefGoogle Scholar
  • Armony M, Ward AR (2010) Fair dynamic routing in large-scale heterogeneous-server systems. Oper. Res. 58(3):624–637.LinkGoogle Scholar
  • Ata B, Peng X (2020) An optimal callback policy for general arrival processes: A pathwise analysis. Oper. Res. 68(2):1–21.Google Scholar
  • Ata B, Van Mieghem JA (2009) The value of partial resource pooling: Should a service network be integrated or product-focused? Management Sci. 55(1):115–131.LinkGoogle Scholar
  • Baas S, Dijkstra S, Braaksma A, van Rooij P, Snijders FJ, Tiemessen L, Boucherie RJ (2021) Real-time forecasting of covid-19 bed occupancy in wards and intensive care units. Health Care Management Sci. 24(2):402–419.CrossrefGoogle Scholar
  • Bassamboo A, Zeevi A (2009) On a data-driven method for staffing large call centers. Oper. Res. 57(3):714–726.LinkGoogle Scholar
  • Bassamboo A, Randhawa RS, Van Mieghem JA (2012) A little flexibility is all you need: On the asymptotic value of flexible capacity in parallel queuing systems. Oper. Res. 60(6):1423–1435.LinkGoogle Scholar
  • Bassamboo A, Randhawa RS, Zeevi A (2010) Capacity sizing under parameter uncertainty: Safety staffing principles revisited. Management Sci. 56(10):1668–1686.LinkGoogle Scholar
  • Bäuerle N (2000) Asymptotic optimality of tracking policies in stochastic networks. Ann. Appl. Probability 10(4):1065–1083.CrossrefGoogle Scholar
  • Bäuerle N (2002) Optimal control of queueing networks: An approach via fluid models. Adv. Appl. Probability 34(2):313–328.CrossrefGoogle Scholar
  • Bell SL, Williams RJ (2001) Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probability 11(3):608–649.CrossrefGoogle Scholar
  • Best TJ, Sandikçi B, Eisenstein BD, Meltzer DO (2015) Managing hospital inpatient bed capacity through partitioning care into focused wings. Manufacturing Service Oper. Management 17(2):157–176.LinkGoogle Scholar
  • Borst S, Mandelbaum A, Reiman MI (2004) Dimensioning large call centers. Oper. Res. 52(1):17–34.LinkGoogle Scholar
  • Bramson M, D’Auria B, Walton N (2021) Stability and instability of the maxweight policy. Math. Oper. Res. 46(4):1611–1638.LinkGoogle Scholar
  • Buyukkoc C, Varaiya P, Walrand J (1985) The cμ rule revisited. Adv. Appl. Probability 17(1):237–238.CrossrefGoogle Scholar
  • Chang J, Ayhan H, Dai JG, Xia CH (2004) Dynamic scheduling of a multiclass fluid model with transient overload. Queueing Systems 48(3):263–307.CrossrefGoogle Scholar
  • Chen J, Dong J, Shi P (2020) A survey on skill-based routing with applications to service operations management. Queueing Systems 96:53–82.CrossrefGoogle Scholar
  • Dai JG, Harrison MJ (2020) Processing Networks: Fluid Models and Stability (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Dai JG, Lin W (2005) Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2):197–218.LinkGoogle Scholar
  • Dai JG, Lin W (2008) Asymptotic optimality of maximum pressure policies in stochastic processing networks. Ann. Appl. Probability 18(6):2239–2299.CrossrefGoogle Scholar
  • Delana K, Savva N, Tezcan T (2021) Proactive customer service: Operational benefits and economic frictions. Manufacturing Service Oper. Management 23(1):70–87.LinkGoogle Scholar
  • Dong J, Shi P, Zheng F, Jin X (2019) Off-service placement in inpatient ward network: Resource pooling vs. service slowdown. Working paper, Columbia Business School, New York.Google Scholar
  • Garnett O, Mandelbaum A (2000) An introduction to skills-based routing and its operational complexities. Teaching notes, Technion - Israel Institute of Technology, Haifa, Israel.Google Scholar
  • Grass D, Caulkins J, Feichtinger G, Tragler G, Behrens D (2008) Optimal Control of Nonlinear Processes: With Applications in Drugs, Corruption, and Terror (Springer, Berlin).CrossrefGoogle Scholar
  • Graves SC, Tomlin BT (2003) Process flexibility in supply chains. Management Sci. 49(7):907–919.LinkGoogle 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
  • Hampshire RC, Massey WA (2010) Dynamic optimization with applications to dynamic rate queues. Risk and Optimization in an Uncertain World (INFORMS), 208–247.LinkGoogle Scholar
  • Harrison JM (1998) Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies. Ann. Appl. Probability 8(3):822–848.CrossrefGoogle Scholar
  • Hartl RF, Sethi SP, Vickson RG (1995) A survey of the maximum principles for optimal control problems with state constraints. SIAM Rev. 37(2):181–218.CrossrefGoogle Scholar
  • Hu Y, Chan CW, Dong J (2022) Optimal scheduling of proactive service with customer deterioration and improvement. Management Sci. 68(4):2533–2578.Google Scholar
  • Hu Y, Chan CW, Dong J (2021) Prediction-driven surge planning with application in the emergency department. Working paper, Columbia Business School, New York.Google Scholar
  • Ibrahim R, L’Ecuyer P (2013) Forecasting call center arrivals: Fixed-effects, mixed-effects, and bivariate models. Manufacturing Service Oper. Management 15(1):72–85.LinkGoogle Scholar
  • Iglehart DL, Whitt W (1970) Multiple channel queues in heavy traffic. i. Adv. Appl. Probability 2(1):150–177.CrossrefGoogle Scholar
  • Institute for Health Metrics and Evaluation (2022) Covid-19 projections. Accessed May 22, 2022, https://covid19.healthdata.org/united-states-of-america.Google Scholar
  • Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313–345.LinkGoogle Scholar
  • Liu Y, Whitt W (2011) A network of time-varying many-server fluid queues with customer abandonment. Oper. Res. 59(4):835–846.LinkGoogle Scholar
  • Maglaras C (2000) Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality. Ann. Appl. Probability 10(3):897–929.CrossrefGoogle Scholar
  • Maman S, Mandelbaum A, Zeltyn S (2009) Uncertainty in the demand for service: The case of call centers and emergency departments. PhD thesis, Technion-Israel Institute of Technology, Faculty of Industrial and Management, Haifa, Israel.Google Scholar
  • Mandelbaum A, Reiman MI (1998) On pooling in queueing networks. Management Sci. 44(7):971–981.LinkGoogle Scholar
  • Mandelbaum A, Stolyar AL (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6):836–855.LinkGoogle Scholar
  • Mandelbaum A, Massey WA, Reiman MI (1998) Strong approximations for markovian service networks. Queueing Systems 30(1):149–201.CrossrefGoogle Scholar
  • Naor P (1969) The regulation of queue size by levying tolls. Econometrica 37(1):15–24.CrossrefGoogle Scholar
  • Pinker EJ, Shumsky RA (2000) The efficiency-quality trade-off of cross-trained workers. Manufacturing Service Oper. Management 2(1):32–48.LinkGoogle Scholar
  • Sethi SP, Thompson GL (2000) Optimal Control Theory (Springer, Berlin).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.LinkGoogle Scholar
  • Shu J, Chou MC, Liu Q, Teo CP, Wang IL (2013) Models for effective deployment and redistribution of bicycles within public bicycle-sharing systems. Oper. Res. 61(6):1346–1359.LinkGoogle Scholar
  • Simchi-Levi D, Wei Y (2012) Understanding the performance of the long chain and sparse designs in process flexibility. Oper. Res. 60(5):1125–1141.LinkGoogle Scholar
  • Smith DR, Whitt W (1981) Resource sharing for efficiency in traffic systems. Bell Systems Tech. J. 60(1):39–55.CrossrefGoogle Scholar
  • Song H, Tucker AL, Murrell KL (2015) The diseconomies of queue pooling: An empirical investigation of emergency department length of stay. Management Sci. 61(12):3032–3053.LinkGoogle Scholar
  • Song H, Tucker AL, Graue R, Moravick S, Yang JJ (2019) Capacity pooling in hospitals: The hidden consequences of off-service placement. Manage. Sci. 66(9):3825–3842.LinkGoogle Scholar
  • Stein C, Truong V-A, Wang X (2020) Advance service reservations with heterogeneous customers. Management Sci. 66(7):2929–2950.LinkGoogle Scholar
  • Stolyar AL (2004) MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probability 14(1):1–53.CrossrefGoogle Scholar
  • Tekin E, Hopp WJ, Van Oyen MP (2002) Benefits of skill chaining in production lines with cross-trained workers. Manufacturing Service Oper. Management 4(1):17–20.LinkGoogle Scholar
  • Tsitsiklis JN, Xu K (2012) On the power of (even a little) resource pooling. Stochastic Systems 2(1):1–66.LinkGoogle Scholar
  • Tzen B, Raginsky M (2019) Neural stochastic differential equations: Deep latent gaussian models in the diffusion limit. Preprint, submitted May, https://arxiv.org/abs/1905.09883.Google Scholar
  • van Mieghem JA (1995) Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probability 5(3):809–833.CrossrefGoogle Scholar
  • van Mieghem JA (1998) Investment strategies for flexible resources. Management Sci. 44(8):1071–1078.LinkGoogle Scholar
  • Xu K, Chan CW (2016) Using future information to reduce waiting times in the emergency department via diversion. Manufacturing Service Oper. Management 18(3):314–331.LinkGoogle Scholar
  • Yom-Tov GB, Mandelbaum A (2014) Erlang-r: A time-varying queue with reentrant customers, in support of healthcare staffing. Manufacturing Service Oper. Management 16(2):283–299.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.