Optimal Policies and Heuristics to Match Supply with Demand for Online Retailing
Author
Abstract
Suggested Citation
DOI: 10.1287/msom.2021.0394
Download full text from publisher
References listed on IDEAS
- Dr. Nikolai Ostapenko, 2013. "Online Discount Luxury: In Search of Guilty Customers," International Journal of Business and Social Research, MIR Center for Socio-Economic Research, vol. 3(2), pages 60-68, February.
- Zeyang Wu & Kameng Nip & Qie He, 2021. "A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1197-1212, July.
- Paul H. Zipkin, 1980. "Simple Ranking Methods for Allocation of One Resource," Management Science, INFORMS, vol. 26(1), pages 34-43, January.
- Yuanguang Zhong & Zhichao Zheng & Mabel C. Chou & Chung-Piaw Teo, 2018. "Resource Pooling and Allocation Policies to Deliver Differentiated Service," Management Science, INFORMS, vol. 64(4), pages 1555-1573, April.
- Awi Federgruen & Gregory Prastacos & Paul H. Zipkin, 1986. "An Allocation and Distribution Model for Perishable Products," Operations Research, INFORMS, vol. 34(1), pages 75-82, February.
- Jason Acimovic & Stephen C. Graves, 2015. "Making Better Fulfillment Decisions on the Fly in an Online Retail Environment," Manufacturing & Service Operations Management, INFORMS, vol. 17(1), pages 34-51, February.
- Sentao Miao & Stefanus Jasin & Xiuli Chao, 2022. "Asymptotically Optimal Lagrangian Policies for Multi-Warehouse, Multi-Store Systems with Lost Sales," Operations Research, INFORMS, vol. 70(1), pages 141-159, January.
- Jason Acimovic & Stephen C. Graves, 2017. "Mitigating Spillover in Online Retailing via Replenishment," Manufacturing & Service Operations Management, INFORMS, vol. 19(3), pages 419-436, July.
- Groenevelt, H., 1991. "Two algorithms for maximizing a separable concave function over a polymatroid feasible region," European Journal of Operational Research, Elsevier, vol. 54(2), pages 227-236, September.
- A. Chambolle & Ch. Dossal, 2015. "On the Convergence of the Iterates of the “Fast Iterative Shrinkage/Thresholding Algorithm”," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 968-982, September.
- Dr. Nikolai Ostapenko, 2013. "Online Discount Luxury: In Search of Guilty Customers," International Journal of Business and Social Research, LAR Center Press, vol. 3(2), pages 60-68, February.
- Awi Federgruen & Henri Groenevelt, 1986. "The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality," Operations Research, INFORMS, vol. 34(6), pages 909-918, December.
- Kris Johnson Ferreira & Bin Hong Alex Lee & David Simchi-Levi, 2016. "Analytics for an Online Retailer: Demand Forecasting and Price Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 69-88, February.
- Pavithra Harsha & Shivaram Subramanian & Joline Uichanco, 2019. "Dynamic Pricing of Omnichannel Inventories," Service Science, INFORMS, vol. 21(1), pages 47-65, January.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Wang, Nannan & Methapatara, Chinnatat & Liu, Tieming & Jian, Ming, 2025. "Hedging demand uncertainty in a two-echelon supply chain: Advanced purchase discount or transshipment or both?," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Yun Fong Lim & Song Jiu & Marcus Ang, 2021. "Integrating Anticipative Replenishment Allocation with Reactive Fulfillment for Online Retailing Using Robust Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 23(6), pages 1616-1633, November.
- Gabor, Adriana F. & van Ommeren, Jan-Kees & Sleptchenko, Andrei, 2022. "An inventory model with discounts for omnichannel retailers of slow moving items," European Journal of Operational Research, Elsevier, vol. 300(1), pages 58-72.
- Ayoub Amil & Ali Makhdoumi & Yehua Wei, 2025. "Multi-Item Order Fulfillment Revisited: LP Formulation and Prophet Inequality," Management Science, INFORMS, vol. 71(12), pages 9917-9935, December.
- Quan Zhou & Mehmet Gümüş & Sentao Miao, 2025. "E-Commerce Order Fulfillment Problem with Limited Time Window," Operations Research, INFORMS, vol. 73(6), pages 2914-2932, November.
- Sanjith Gopalakrishnan & Moksh Matta & Mona Imanpoor Yourdshahy & Vivek Choudhary, 2023. "Go Wide or Go Deep? Assortment Strategy and Order Fulfillment in Online Retail," Manufacturing & Service Operations Management, INFORMS, vol. 25(3), pages 846-861, May.
- Kim, Nayeon & Montreuil, Benoit & Klibi, Walid & Zied Babai, M., 2023. "Network inventory deployment for responsive fulfillment," International Journal of Production Economics, Elsevier, vol. 255(C).
- Yanzhe (Murray) Lei & Stefanus Jasin & Joline Uichanco & Andrew Vakhutinsky, 2022. "Joint Product Framing (Display, Ranking, Pricing) and Order Fulfillment Under the Multinomial Logit Model for E-Commerce Retailers," Manufacturing & Service Operations Management, INFORMS, vol. 24(3), pages 1529-1546, May.
- Xueqi Wu & Zhi‐Long Chen, 2022. "Fulfillment scheduling for buy‐online‐pickup‐in‐store orders," Production and Operations Management, Production and Operations Management Society, vol. 31(7), pages 2982-3003, July.
- Zhaohui (Zoey) Jiang & Jun Li, 2025. "Instrumenting While Experimenting: An Empirical Method for Competitive Pricing at Scale," Operations Research, INFORMS, vol. 73(5), pages 2477-2495, September.
- Levi DeValve & Jabari Myles, 2025. "Approximation Algorithms for Dynamic Inventory Management on Networks," Management Science, INFORMS, vol. 71(7), pages 5893-5909, July.
- Kris Johnson Ferreira & Bin Hong Alex Lee & David Simchi-Levi, 2016. "Analytics for an Online Retailer: Demand Forecasting and Price Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 69-88, February.
- Bayram, Armagan & Cesaret, Bahriye, 2021. "Order fulfillment policies for ship-from-store implementation in omni-channel retailing," European Journal of Operational Research, Elsevier, vol. 294(3), pages 987-1002.
- Jiu, Song, 2022. "Robust omnichannel retail operations with the implementation of ship-from-store," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
- Santiago R. Balseiro & Omar Besbes & Dana Pizarro, 2024. "Survey of Dynamic Resource-Constrained Reward Collection Problems: Unified Model and Analysis," Operations Research, INFORMS, vol. 72(5), pages 2168-2189, September.
- Levi DeValve & Yehua Wei & Di Wu & Rong Yuan, 2023. "Understanding the Value of Fulfillment Flexibility in an Online Retailing Environment," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 391-408, March.
- Nooshin Salari & Sheng Liu & Zuo-Jun Max Shen, 2022. "Real-Time Delivery Time Forecasting and Promising in Online Retailing: When Will Your Package Arrive?," Manufacturing & Service Operations Management, INFORMS, vol. 24(3), pages 1421-1436, May.
- Zhang, Yuankai & Lin, Wei-Hua & Huang, Minfang & Hu, Xiangpei, 2021. "Multi-warehouse package consolidation for split orders in online retailing," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1040-1055.
- Awi Federgruen & Nan Yang, 2008. "Selecting a Portfolio of Suppliers Under Demand and Supply Risks," Operations Research, INFORMS, vol. 56(4), pages 916-936, August.
- Renato de Matta & Vernon Ning Hsu & Timothy J. Lowe, 1999. "The selection allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 707-725, September.
- Zhou, Yong-Wu & Zhang, Xiong & Zhong, Yuanguang & Cao, Bin & Cheng, T.C. Edwin, 2021. "Dynamic pricing and cross-channel fulfillment for omnichannel retailing industry: An approximation policy and implications," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormsom:v:26:y:2024:i:5:p:1925-1944. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Printed from https://ideas.repec.org/a/inm/ormsom/v26y2024i5p1925-1944.html