Spatial Capacity Planning

References

• Afèche P, Liu Z, Maglaras C (2018) Ride-hailing networks with strategic drivers: The impact of platform control capabilities on performance. Working paper, Columbia University, New York.Google 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.Crossref, Google Scholar
• Ang M, Sigman K, Song JS, Zhang H (2017) Closed-form approximations for optimal (r,q) and (s,t) policies in a parallel processing environment. Oper. Res. 65(5):1414–1428.Link, Google Scholar
• Atar R (2012) A diffusion regime with nondegenerate slowdown. Oper. Res. 60(2):490–500.Link, Google Scholar
• Banerjee S, Freund D, Lykouris T (2016) Pricing and optimization in shared vehicle systems: An approximation framework. Preprint, submitted August 24, https://arxiv.org/abs/1608.06819.Google Scholar
• Banerjee S, Kanoria Y, Qian P (2018) State dependent control of closed queueing networks. ACM SIGMETRICS Performance Evaluation Rev. 46(1):2–4.Google Scholar
• Banerjee S, Riquelme C, Johari R (2015) Pricing in ride-share platforms: A queueing-theoretic approach. Working paper, Stanford University, Stanford, CA.Google Scholar
• Bassamboo A, Randhawa RS, Zeevi A (2010) Capacity sizing under parameter uncertainty: Safety staffing principles revisited. Management Sci. 56(10):1668–1686.Link, Google Scholar
• Benjaafar S, Jiang D, Li X, Li X (2019) Dynamic inventory repositioning in on-demand rental networks. Working paper, University of Minnesota, Minneapolis.Google Scholar
• Bertsimas DJ, van Ryzin G (1991) A stochastic and dynamic vehicle routing problem in the euclidean plane. Oper. Res. 39(4):601–615.Link, Google Scholar
• Bertsimas DJ, van Ryzin G (1993) Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Oper. Res. 41(1):60–76.Link, Google Scholar
• Besbes O, Castro F, Lobel I (2021) Surge pricing and its spatial supply response. Management Sci. 67(3):1350–1367.Google Scholar
• Bimpikis K, Candogan O, Saban D (2019) Spatial pricing in ride-sharing networks. Oper. Res. 67(3):744–769.Link, Google Scholar
• Braverman A, Dai JG, Liu X, Ying L (2019) Empty-car routing in ridesharing systems. Oper. Res. 67(5):1437–1452.Google Scholar
• Castillo JC, Knoepfle D, Weyl G (2017) Surge pricing solves the wild goose chase. Proc. 2017 ACM Conf. Econom. Comput. (ACM, New York), 241–242.Google Scholar
• Chan CW, Yom-Tov G, Escobar G (2014) When to use speedup: An examination of service systems with returns. Oper. Res. 62(2):462–482.Link, Google Scholar
• Dong J, Feldman P, Yom-Tov GB (2015) Service systems with slowdowns: Potential failures and proposed solutions. Oper. Res. 63(2):305–324.Link, Google Scholar
• Feng G, Kong G, Wang Z (2020) We are on the way: Analysis of on-demand ride-hailing systems. Manufacturing Service Oper. Management, ePub ahead of print June 3, https://pubsonline.informs.org/doi/pdf/10.1287/msom.2020.0880.Google Scholar
• Gans N, Koole G, Mandelbaum A (2003) Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5(2):79–141.Link, Google Scholar
• Garnett O, Mandelbaum A, Reiman M (2002) Designing a call center with impatient customers. Manufacturing Service Oper. Management 4(3):208–227.Link, Google Scholar
• Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.Link, Google Scholar
• Mandelbaum A, Pats G (1995) State-dependent queues: approximations and applications. Stochastic Networks 71:239–282.Crossref, Google Scholar
• Mandelbaum A, Pats G (1998) State-dependent stochastic networks. Part i. Approximations and applications with continuous diffusion limits. Ann. Appl. Probabilities 8(2):569–646.Crossref, Google Scholar
• Nikzad A (2017) Thickness and competition in ride-sharing markets. Preprint, submitted August 1, https://ssrn.com/abstract=3065672.Google Scholar
• Ozkan E (2020) Joint pricing and matching in ride-sharing systems. Eur. J. Oper. Res. 287(3):1149–1160.Google Scholar
• Ozkan E, Ward AR (2020) Dynamic matching for real-time ridesharing. Stochastic Systems 10(1):29–70.Google Scholar
• Powell SG, Schultz KL (2004) Throughput in serial lines with state-dependent behavior. Management Sci. 50(8):1095–1105.Link, Google Scholar
• Reed J (2009) The G/GI/N queue in the halfin—Whitt regime. Ann. Appl. Probabilities 19(6):2211–2269.Crossref, Google Scholar
• Ward AR (2012) Asymptotic analysis of queueing systems with reneging: A survey of results for fifo, single class models. Surveys Oper. Res. Management Sci. 17(1):1–14.Crossref, Google Scholar
• Whitt W (2004) Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. 50(10):1449–1461.Link, Google Scholar
• Whitt W (2007) What you should know about queueing models to set staffing requirements in service systems. Naval Res. Logist. 54(5):476–484.Crossref, Google Scholar
• Yan C, Zhu H, Korolko N, Woodard D (2020) Dynamic pricing and matching in ride-hailing platforms. Naval Res. Logist. 67(8):705–724.Google Scholar