Optimal Policies and Heuristics to Match Supply with Demand for Online Retailing

References

• 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
• Acimovic J, Graves SC (2017) Mitigating spillover in online retailing via replenishment. Manufacturing Service Oper. Management 19(3):419–436.Link, Google Scholar
• Ando K, Fujishige S, Naitoh T (1995) A greedy algorithm for minimizing a separable convex function over a finite jump system. J. Oper. Res. Soc. Japan 38(3):362–375.Crossref, Google Scholar
• Chambolle A, Dossal C (2015) On the convergence of the iterates of the fast iterative shrinkage/thresholding algorithm. J. Optim. Theory Appl. 166(3):968–982.Crossref, Google Scholar
• Eppen G, Schrage L (1981) Centralized ordering policies in a multi-warehouse system with lead times and random demand. Schwarz LB, ed. Multi-level Production/Inventory Control Systems. Theory and Practice (North-Holland Publishing Company, Amsterdam), 51–67.Google Scholar
• Federgruen A, Groenevelt H (1986) The greedy procedure for resource allocation problems: Necessary and sufficient conditions for optimality. Oper. Res. 34(6):909–918.Link, Google Scholar
• Federgruen A, Prastacos G, Zipkin PH (1986) An allocation and distribution model for perishable products. Oper. Res. 34(1):75–82.Link, Google Scholar
• Ferreira KJ, Lee BHA, Simchi-Levi D (2016) Analytics for an online retailer: Demand forecasting and price optimization. Manufacturing Service Oper. Management 18(1):69–88.Link, Google Scholar
• Groenevelt H (1991) Two algorithms for maximizing a separable concave function over a polymatroid feasible region. Eur. J. Oper. Res. 54(25):227–236.Crossref, Google Scholar
• Harsha P, Subramanian S, Uichanco J (2019) Dynamic pricing of omnichannel inventories. Manufacturing Service Oper. Management 21(1):47–65.Link, Google Scholar
• Insider Intelligence (2023) Worldwide Ecommerce Forecast 2023. Accessed January 22, 2024, https://www.insiderintelligence.com/content/worldwide-ecommerce-forecast-2023.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
• Kharpal A (2021) Alibaba, JD smash Singles Day record with $139 billion of sales and focus on ‘social responsibility’. CNBC (November 11), https://www.cnbc.com/2021/11/12/china-singles-day-2021-alibaba-jd-hit-record-139-billion-of-sales.html.Google Scholar
• Lei Y, Jasin S, Sinha A (2018) Joint dynamic pricing and order fulfillment for e-commerce retailers. Manufacturing Service Oper. Management 20(2):269–284.Link, Google Scholar
• Lim YF, Jiu S, Ang M (2020) Integrating anticipative replenishment allocation with reactive fulfillment for online retailing using robust optimization. Manufacturing Service Oper. Management 23(6):1616–1633.Link, Google Scholar
• Liu F (2017) A greedy algorithm for solving ordinary transportation problem with capacity constraints. Oper. Res. Lett. 45(4):388–391.Crossref, Google Scholar
• Local Offer Network (2011) The daily deal phenomenon: A year in review. Report, Local Offer Network, Chicago.Google Scholar
• Lovász L (1983) Submodular functions and convexity. Bachem A, Korte B, Grötschel M, eds. Mathematical Programming: The State of the Art (Springer, Berlin), 235–257.Crossref, Google Scholar
• Miao S, Jasin S, Chao X (2022) Asymptotically optimal Lagrangian policies for multi-warehouse, multi-store systems with lost sales. Oper. Res. 70(1):141–159.Link, Google Scholar
• Ostapenko N (2013) Online discount luxury: In search of guilty customers. Internat. J. Bus. Soc. Res. 3(2):60–68.Google Scholar
• Vidal T, Gribel D, Jaillet P (2019) Separable convex optimization with nested lower and upper constraints. INFORMS J. Optim. 1(1):71–90.Link, Google Scholar
• Vidal T, Jaillet P, Maculan N (2016) A decomposition algorithm for nested resource allocation problems. SIAM J. Optim. 26(2):1322–1340.Google Scholar
• Wolverson R (2012) High and low: Online flash sales go beyond fashion to survive. Time Magazine 180(19):9–12.Google Scholar
• Wu Z, Nip K, He Q (2021) A new combinatorial algorithm for separable convex resource allocation with nested bound constraints. INFORMS J. Comput. 33(3):1197–1212.Link, Google Scholar
• Xu PJ, Allgor R, Graves SC (2009) Benefits of reevaluating real-time order fulfillment decisions. Manufacturing Service Oper. Management 11(2):340–355.Link, Google Scholar
• Zhong Y, Zheng Z, Chou MC, Teo C-P (2018) Resource pooling and allocation policies to deliver differentiated service. Management Sci. 64(4):1555–1573.Link, Google Scholar
• Zipkin PH (1980) Simple ranking methods for allocation of one resource. Management Sci. 26(1):34–43.Link, Google Scholar