Robust Allocation Policies for Distribution Inventory Systems with Replenishment

Published Online:https://doi.org/10.1287/msom.2023.0502

References

  • Alon N, Cosares S, Hochbaum DS, Shamir R (1989) An algorithm for the detection and construction of Monge sequences. Linear Algebra Appl. 114–115:669–680.CrossrefGoogle Scholar
  • Ardestani-Jaafari A, Delage E (2016) Robust optimization of sums of piecewise linear functions with application to inventory problems. Oper. Res. 64(2):474–494.LinkGoogle Scholar
  • Axsäter S (2003) Supply chain operations: Serial and distribution inventory systems. Graves SC, de Kok AG, eds. Handbooks in Operations Research and Management Science, vol. 11 (North Holland, Amsterdam), 525–559.CrossrefGoogle Scholar
  • Bertsimas D, Thiele A (2006) A robust optimization approach to inventory theory. Oper. Res. 54(1):150–168.LinkGoogle Scholar
  • Bertsimas D, Gupta V, Kallus N (2018) Data-driven robust optimization. Math. Programming 167(2):235–292.CrossrefGoogle Scholar
  • Bertsimas D, Sim M, Zhang M (2019) Adaptive distributionally robust optimization. Management Sci. 65(2):604–618.LinkGoogle Scholar
  • Clark AJ, Scarf H (1960) Optimal policies for a multi-echelon inventory problem. Management Sci. 6(4):475–490.LinkGoogle Scholar
  • De Kok A (1990) Hierarchical production planning for consumer goods. Eur. J. Oper. Res. 45(1):55–69.CrossrefGoogle 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.LinkGoogle Scholar
  • Doğru MK, De Kok A, van Houtum G-J (2009) A numerical study on the effect of the balance assumption in one-warehouse multi-retailer inventory systems. Flexible Services Manufacturing J. 21:114–147.CrossrefGoogle Scholar
  • Gallego G, Özer Ö, Zipkin P (2007) Bounds, heuristics, and approximations for distribution systems. Oper. Res. 55(3):503–517.LinkGoogle Scholar
  • Gorissen BL, Den Hertog D (2013) Robust counterparts of inequalities containing sums of maxima of linear functions. Eur. J. Oper. Res. 227(1):30–43.CrossrefGoogle Scholar
  • He L, Hu Z, Zhang M (2020) Robust repositioning for vehicle sharing. Manufacturing Service Oper. Management 22(2):241–256.LinkGoogle Scholar
  • Hoffman AJ (1963) On simple linear programming problems. Klee VL, ed. Proc. Sympos. Pure Math.: Convexity, vol. 7 (American Mathematical Society, Providence, RI), 317–327.Google Scholar
  • Jackson PL (1988) Stock allocation in a two-echelon distribution system or “what to do until your ship comes in.” Management Sci. 34(7):880–895.LinkGoogle Scholar
  • Jackson PL, Muckstadt JA (1989) Risk pooling in a two-period, two-echelon inventory stocking and allocation problem. Naval Res. Logist. 36(1):1–26.CrossrefGoogle Scholar
  • Jackson PL, Muckstadt JA, Li Y (2019) Multiperiod stock allocation via robust optimization. Management Sci. 65(2):794–818.LinkGoogle Scholar
  • Kunnumkal S, Topaloglu H (2008) A duality-based relaxation and decomposition approach for inventory distribution systems. Naval Res. Logist. 55(7):612–631.CrossrefGoogle Scholar
  • Lagodimos A, Koukoumialos S (2008) Service performance of two-echelon supply chains under linear rationing. Internat. J. Production Econom. 112(2):869–884.CrossrefGoogle Scholar
  • Lim YF, Jiu S, Ang M (2021) Integrating anticipative replenishment allocation with reactive fulfillment for online retailing using robust optimization. Manufacturing Service Oper. Management 23(6):1616–1633.LinkGoogle Scholar
  • Mamani H, Nassiri S, Wagner MR (2017) Closed-form solutions for robust inventory management. Management Sci. 63(5):1625–1643.LinkGoogle Scholar
  • Marklund J, Rosling K (2012) Lower bounds and heuristics for supply chain stock allocation. Oper. Res. 60(1):92–105.LinkGoogle Scholar
  • McGavin EJ, Ward JE, Schwarz LB (1993) Two-interval inventory-allocation policies in a one-warehouse N-identical-retailer distribution system. Management Sci. 39(9):1092–1107.LinkGoogle 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.LinkGoogle Scholar
  • Nambiar M, Simchi-Levi D, Wang H (2021) Dynamic inventory allocation with demand learning for seasonal goods. Production Oper. Management 30(3):750–765.CrossrefGoogle Scholar
  • Shamir R (1993) A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs. Discrete Math. 114(1–3):435–444.CrossrefGoogle Scholar
  • Shamir R, Dietrich B (1990) Characterization and algorithms for greedily solvable transportation problems. SODA’90: Proc. First Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 358–366.Google Scholar
  • Sun J, Van Mieghem JA (2019) Robust dual sourcing inventory management: Optimality of capped dual index policies and smoothing. Manufacturing Service Oper. Management 21(4):912–931.LinkGoogle Scholar
  • Tseytlin Y, Heese HS (2019) Allocation under a general substitution structure. Eur. J. Oper. Res. 277(2):492–506.CrossrefGoogle Scholar
  • van der Heijden MC (1997) Supply rationing in multi-echelon divergent systems. Eur. J. Oper. Res. 101(3):532–549.CrossrefGoogle Scholar
  • Xie C, Wang L, Yang C (2021) Robust inventory management with multiple supply sources. Eur. J. Oper. Res. 295(2):463–474.CrossrefGoogle Scholar
  • Zhou W, Lee C-Y, Wu D (2011) Optimal control of a capacitated inventory system with multiple demand classes: Optimal control of a capacitated inventory system. Naval Res. Logist. 58(1):43–58.CrossrefGoogle 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.