Robust Inventory Management: A Cycle-Based Approach

References

• 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.Link, Google Scholar
• Atkins DR, Iyogun PO (1988) Periodic vs. ‘can-order’ policies for coordinated multi-item inventory systems. Management Sci. 34(6):791–796.Link, Google Scholar
• Bandi C, Bertsimas D (2012) Tractable stochastic analysis in high dimensions via robust optimization. Math. Programming Ser. B 134(1):23–70.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math. Oper. Res. 23(4):769–805.Link, Google Scholar
• Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming Ser. A 88(3):411–424.Crossref, Google Scholar
• Ben-Tal A, Golany B, Nemirovski A, Vial JP (2005) Retailer-supplier flexible commitments contracts: A robust optimization approach. Manufacturing Service Oper. Management 7(3):248–271.Link, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Bertsimas D, Thiele A (2006) A robust optimization approach to inventory theory. Oper. Res. 54(1):150–168.Link, Google Scholar
• Bertsimas D, Iancu DA, Parrilo PA (2010) Optimality of affine policies in multistage robust optimization. Math. Oper. Res. 35(2):363–394.Link, Google Scholar
• Bienstock D, Özbay N (2008) Computing robust basestock levels. Discrete Optim. 5(2):389–414.Crossref, Google Scholar
• Bijvank M, Vis IF (2011) Lost-sales inventory theory: A review. Eur. J. Oper. Res. 215(1):1–13.Crossref, Google Scholar
• Bijvank M, Bhulai S, Huh WT (2015) Parametric replenishment policies for inventory systems with lost sales and fixed order cost. Eur. J. Oper. Res. 241(2):381–390.Crossref, Google Scholar
• Brown DB, Smith JE (2014) Information relaxations, duality, and convex stochastic dynamic programs. Oper. Res. 62(6):1394–1415.Link, Google Scholar
• Chen X, Sim M, Sun P (2007) A robust optimization perspective on stochastic programming. Oper. Res. 55(6):1058–1071.Link, Google Scholar
• Cheng F, Sethi SP (1999) Optimality of state-dependent (s, S) policies in inventory models with Markov-modulated demand and lost sales. Production Oper. Management 8(2):183–192.Crossref, Google Scholar
• El Ghaoui L, Lebret H (1997) Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 18(4):1035–1064.Crossref, Google Scholar
• El Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9(1):33–52.Crossref, Google Scholar
• Federgruen A, Tzur M (1999) Time-partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot-sizing problems. Naval Res. Logist. 46(5):463–486.Crossref, Google Scholar
• Federgruen A, Zipkin P (1986) An inventory model with limited production capacity and uncertain demands II. The discounted-cost criterion. Math. Oper. Res. 11(2):208–215.Link, Google Scholar
• Gallego G, Moon I (1993) The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. 44(8):825–834.Crossref, Google Scholar
• Gallego G, Ryan JK, Simchi-Levi D (2001) Minimax analysis for finite-horizon inventory models. IIE Trans. 33(10):861–874.Crossref, Google Scholar
• Glasserman P, Tayur S (1995) Sensitivity analysis for base-stock levels in multiechelon production-inventory systems. Management Sci. 41(2):263–281.Link, Google Scholar
• Gruen T, Corsten D, Bharadwaj S (2002) Retail Out-of-Stocks: A Worldwide Examination of Extent, Causes and Consumer Responses (Grocery Manufacturers of America, Washington, DC).Google Scholar
• Janakiraman G, Roundy RO (2004) Lost-sales problems with stochastic lead times: Convexity results for base-stock policies. Oper. Res. 52(5):795–803.Link, Google Scholar
• Karlin S (1960) Dynamic inventory policy with varying stochastic demands. Management Sci. 6(3):231–258.Link, Google Scholar
• Levi R, Janakiraman G, Nagarajan M (2008) A 2-approximation algorithm for stochastic inventory control models with lost sales. Math. Oper. Res. 33(2):351–374.Link, Google Scholar
• Levi R, Pál M, Roundy RO, Shmoys DB (2007) Approximation algorithms for stochastic inventory control models. Math. Oper. Res. 32(2):284–302.Link, Google Scholar
• Li Q, Yu P (2012) Technical note: On the quasiconcavity of lost-sales inventory models with fixed costs. Oper. Res. 60(2):286–291.Link, Google Scholar
• Liu F, Song JS (2012) Good and bad news about the (S, T) policy. Manufacturing Service Oper. Management 14(1):42–49.Link, Google Scholar
• Mamani H, Nassiri S, Wagner MR (2017) Closed-form solutions for robust inventory management. Management Sci. 63(5):1625–1643.Link, Google Scholar
• Morton T (1971) The near-myopic nature of the lagged-proportional-cost inventory problem with lost sales. Oper. Res. 19(7):1708–1716.Link, Google Scholar
• Nahmias S (1979) Simple approximations for a variety of dynamic leadtime lost-sales inventory models. Oper. Res. 27(5):904–924.Link, Google Scholar
• Rao US (2003) Properties of the periodic review (R, T) inventory control policy for stationary, stochastic demand. Manufacturing Service Oper. Management 5(1):37–53.Link, Google Scholar
• Scarf H (1960) The optimality of (S, s) policies in the dynamic inventory problem. Arrow KJ, Karlin S, Suppes P, eds. Mathematical Methods in the Social Sciences (Stanford University Press, Stanford, CA), 196–202.Google Scholar
• See CT, Sim M (2010) Robust approximation to multiperiod inventory management. Oper. Res. 58(3):583–594.Link, Google Scholar
• Sethi SP, Cheng F (1997) Optimality of (s, S) policies in inventory models with Markovian demand. Oper. Res. 45(6):931–939.Link, Google Scholar
• Shang KH, Tao Z, Zhou SX (2015) Optimizing reorder intervals for two-echelon distribution systems with stochastic demand. Oper. Res. 63(2):458–475.Link, Google Scholar
• Solyalı O, Cordeau JF, Laporte G (2016) The impact of modeling on robust inventory management under demand uncertainty. Management Sci. 62(4):1188–1201.Link, Google Scholar
• Song JS, Zipkin P (1993) Inventory control in a fluctuating demand environment. Oper. Res. 41(2):351–370.Link, Google Scholar
• Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5):1154–1157.Link, 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.Link, Google Scholar
• Veinott AF (1966) On the optimality of (s, S) inventory policies: New conditions and a new proof. SIAM J. Appl. Math. 14(5):1067–1083.Crossref, Google Scholar
• Zhang H, Chao X, Shi C (2020) Closing the gap: A learning algorithm for lost-sales inventory systems with lead times. Management Sci. 66(5):1962–1980.Link, Google Scholar
• Zheng YS, Federgruen A (1991) Finding optimal (s, S) policies is about as simple as evaluating a single policy. Oper. Res. 39(4):654–665.Link, Google Scholar
• Zipkin P (1989) Critical number policies for inventory models with periodic data. Management Sci. 35(1):71–80.Link, Google Scholar
• Zipkin P (2000) Foundations of Inventory Management (McGraw-Hill, New York).Google Scholar
• Zipkin P (2008) Old and new methods for lost-sales inventory systems. Oper. Res. 56(5):1256–1263.Link, Google Scholar