The Benefits of Delay to Online Decision Making

References

• Acimovic J, Farias VF (2019) The fulfillment-optimization problem. Netessine S, ed. Operations Research & Management Science in the Age of Analytics. INFORMS TutORials in Operations Research (INFORMS, Catonsville, MD), 218–237.Link, Google Scholar
• Acimovic J, Graves SC (2015) Making better fulfillment decisions on the fly in an online retail environment. Manufacturing Service Oper. Management 17(1):34–51.Link, Google Scholar
• Akbarpour M, Li S, Gharan SO (2020) Thickness and information in dynamic matching markets. J. Political Econom. 128(3):783–815.Crossref, Google Scholar
• Amil A, Makhdoumi A, Wei Y (2025) Multi-item order fulfillment revisited: LP formulation and prophet inequality. Management Sci., ePub ahead of print April 8, https://doi.org/10.1287/mnsc.2023.00357.Google Scholar
• Aminian MR, Ma W, Xin L (2023) Real-time personalized order holding. Preprint, submitted December 1, https://doi.org/10.2139/ssrn.4644495.Google Scholar
• Andrews JM, Farias VF, Khojandi AI, Yan CM (2019) Primal-dual algorithms for order fulfillment at Urban Outfitters, Inc. INFORMS J. Appl. Analytics 49(5):355–370.Link, Google Scholar
• Arlotto A, Gurvich I (2019) Uniformly bounded regret in the multisecretary problem. Stochastic Systems 9(3):231–260.Link, Google Scholar
• Ashlagi I, Roth AE (2021) Kidney exchange: An operations perspective. Management Sci. 67(9):5455–5478.Link, Google Scholar
• Ashlagi I, Burq M, Dutta C, Jaillet P, Saberi A, Sholley C (2019) Edge weighted online windowed matching. Proc. 2019 ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 729–742.Google Scholar
• Balseiro SR, Lu H, Mirrokni V (2023) The best of many worlds: Dual mirror descent for online allocation problems. Oper. Res. 71(1):101–119.Link, Google Scholar
• Banerjee S, Freund D (2025) Good prophets know when the end is near. Management Sci. 71(6):4877–4894.Link, Google Scholar
• Bray R (2019) Does the multisecretary problem always have bounded regret? Preprint, submitted December 19, https://doi.org/10.2139/ssrn.3497056.Google Scholar
• Bumpensanti P, Wang H (2020) A re-solving heuristic with uniformly bounded loss for network revenue management. Management Sci. 66(7):2993–3009.Link, Google Scholar
• Chen M, Elmachtoub AN, Lei X (2021) Matchmaking strategies for maximizing player engagement in video games. Preprint, submitted September 24, https://doi.org/10.2139/ssrn.3928966.Google Scholar
• Chen S, Song JS, Wei Y (2020) Data-driven scalable e-commerce transportation network design with unknown flow response. Preprint, submitted May 29, https://doi.org/10.2139/ssrn.3590865.Google Scholar
• Chen S, Yan Z, Lim YF (2024) Managing the personalized order-holding problem in online retailing. Manufacturing Service Oper. Management 26(1):47–65.Link, Google Scholar
• DeValve L, Wei Y, Wu D, Yuan R (2023) Understanding the value of fulfillment flexibility in an online retailing environment. Manufacturing Service Oper. Management 25(2):391–408.Link, Google Scholar
• Feng Y, Niazadeh R (2025) Batching and optimal multistage bipartite allocations. Management Sci. 71(5):4108–4130.Link, Google Scholar
• Feng Y, Caldentey R, Xin L, Zhong Y, Wang B, Hu H (2024) Designing sparse graphs for stochastic matching with an application to middle-mile transportation management. Management Sci. 70(12):8988–9013.Link, Google Scholar
• Gallego G, Özer Ö (2001) Integrating replenishment decisions with advance demand information. Management Sci. 47(10):1344–1360.Link, Google Scholar
• Golrezaei N, Yao E (2021) Upfront commitment in online resource allocation with patient customers. Preprint, submitted August 7, https://arxiv.org/abs/2108.03517.Google Scholar
• Graves SC (2022) How to think about planned lead times. Internat. J. Production Res. 60(1):231–241.Crossref, Google Scholar
• Gurvich I, Ward A (2014) On the dynamic control of matching queues. Stochastic Systems 4(2):479–523.Link, Google Scholar
• Ibanez MR, Clark JR, Huckman RS, Staats BR (2018) Discretionary task ordering: Queue management in radiological services. Management Sci. 64(9):4389–4407.Link, Google Scholar
• Jasin S (2015) Performance of an LP-based control for revenue management with unknown demand parameters. Oper. Res. 63(4):909–915.Link, 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.Link, Google Scholar
• Jasin S, Sinha A (2015) An LP-based correlated rounding scheme for multi-item ecommerce order fulfillment. Oper. Res. 63(6):1336–1351.Link, Google Scholar
• Jiang J, Li X, Zhang J (2025) Online stochastic optimization with Wasserstein based non-stationarity. Management Sci., ePub ahead of print March 3, https://doi.org/10.1287/mnsc.2020.03850.Google Scholar
• Kerimov S, Ashlagi I, Gurvich I (2024) Dynamic matching: Characterizing and achieving constant regret. Management Sci. 70(5):2799–2822.Link, Google Scholar
• Kerimov S, Ashlagi I, Gurvich I (2025) On the optimality of greedy policies in dynamic matching. Oper. Res. 73(1):560–582.Link, Google Scholar
• Li X, Sun C, Ye Y (2020) Simple and fast algorithm for binary integer and online linear programming. Larochelle H, Ranzato M, Hadsell R, Balcan MF, Lin H, eds. Advances in Neural Information Processing Systems, vol. 33 (Curran Associates, Red Hook, NY), 9412–9421.Google Scholar
• Li G, Wang Z, Zhang J (2024) Infrequent resolving algorithm for online linear programming. Preprint, submitted August 1, https://arxiv.org/abs/2408.00465.Google Scholar
• Lu Y, Song JS, Yao DD (2003) Order fill rate, leadtime variability, and advance demand information in an assemble-to-order system. Oper. Res. 51(2):292–308.Link, Google Scholar
• Ma W (2023) Order-optimal correlated rounding for fulfilling multi-item e-commerce orders. Manufacturing Service Oper. Management 25(4):1324–1337.Link, Google Scholar
• Mangasarian OL, Shiau TH (1987) Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems. SIAM J. Control Optim. 25(3):583–595.Crossref, Google Scholar
• Qin H, Xiao J, Ge D, Xin L, Gao J, He S, Hu H, Carlsson JG (2022) JD.com: Operations research algorithms drive intelligent warehouse robots to work. INFORMS J. Appl. Analytics 52(1):42–55.Link, Google Scholar
• Reiman M, Wang Q (2008) An asymptotically optimal policy for a quantity-based network revenue management problem. Math. Oper. Res. 33(2):257–282.Link, Google Scholar
• Shen M, Tang CS, Wu D, Yuan R, Zhou W (2024) JD.com: Transaction-level data for the 2020 MSOM Data Driven Research Challenge. Manufacturing Service Oper. Management 26(1):2–10.Link, Google Scholar
• Spencer J, Sudan M, Xu K (2014) Queueing with future information. Ann. Appl. Probab. 24(5):2091–2142.Crossref, Google Scholar
• Uber (2022) How does Uber match riders with drivers? Accessed July 26, 2025, https://marketplace.uber.com/matching.Google Scholar
• Vera A, Banerjee S (2021) The Bayesian prophet: A low-regret framework for online decision making. Management Sci. 67(3):1368–1391.Link, Google Scholar
• Vera A, Banerjee S, Gurvich I (2021) Online allocation and pricing: Constant regret via Bellman inequalities. Oper. Res. 69(3):821–840.Link, Google Scholar
• Wang Y, Wang T, Wang X, Deng Y, Cao L (2024) Data-driven order fulfillment consolidation for online grocery retailing. INFORMS J. Appl. Analytics 54(3):211–221.Link, Google Scholar
• Wei L, Jasin S, Kapuscinski R (2021) Shipping consolidation across two warehouses with delivery deadline and expedited options for e-commerce and omni-channel retailers. Manufacturing Service Oper. Management 23(6):1634–1650.Link, Google Scholar
• Wei Y, Xu J, Yu SH (2023) Constant regret primal-dual policy for multi-way dynamic matching. Abstract Proc. 2023 ACM SIGMETRICS Internat. Conf. Measurement Model. Comput. Systems (Association for Computing Machinery, New York), 79–80.Google Scholar
• Wu D (2018) Going the extra mile in customer service: How does JD.com make order cancellation so easy? JD Technology Blog (October 30), https://medium.com/jd-technology-blog/going-the-extra-mile-in-customer-service-how-does-jd-com-make-order-cancellation-so-easy-a00ebc7fd1ee.Google Scholar
• Xu K (2015) Necessity of future information in admission control. Oper. Res. 63(5):1213–1226.Link, Google 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.Link, Google Scholar
• Xu P, Allgor R, Graves S (2009) Benefits of reevaluating real-time order fulfillment decisions. Manufacturing Service Oper. Management 11(2):340–355.Link, Google Scholar
• Zhao Y, Wang X, Xin L (2025) Multi-item online order fulfillment in a two-layer network. Oper. Res., ePub ahead of print April 30, https://doi.org/10.1287/opre.2022.0100.Google Scholar