Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times

References

• Aviv Y, Federgruen A. Capacitated multi-item inventory systems with random and seasonally fluctuating demands: Implications for postponement strategies. Management Sci. (2001) 47(4):512–531Link, Google Scholar
• Bollapragada S, Morton TE. A simple heuristic for computing nonstationary (s, S) policies. Oper. Res. (1999) 47(4):576–584Link, Google Scholar
• Borodin A, El-Yaniv R. Online Computation and Competitive Analysis (1998) (Cambridge University Press, Cambridge, UK) Google Scholar
• Bouchard B, Karoui NE, Touzi N. Maturity randomization for stochastic control problems. Ann. Appl. Probab. (2005) 15(4):2575–2605Crossref, Google Scholar
• Cheng F, Sethi S. Optimality of (s, S) policies in inventory models with Markovian demand. Oper. Res. (1997) 45(6):931–939Link, Google Scholar
• Federgruen A, Zheng YS. An efficient algorithm for computing an optimal (r, Q) policy in continuous review stochastic inventory systems. Oper. Res. (1991) 40(4):808–813Link, Google Scholar
• Federgruen A, Zipkin PH. An efficient algorithm for computing optimal (s, S) policies. Oper. Res. (1984) 32(6):1268–1285Link, Google Scholar
• Gallego G, Özer Ö. Integrating replenishment decisions with advance demand information. Management Sci. (2001) 47(10):1344–1360Link, Google Scholar
• Gavirneni S. An efficient heuristic for inventory control when the customer is using a (s, S) policy. Oper. Res. Lett. (2001) 28(4):187–192Crossref, Google Scholar
• Guan Y, Miller AJ. A polynomial time algorithm for the stochastic uncapacitated lot-sizing problem with backlogging. Integer Programming and Combinatorial Optimization (2008a) (Springer, Berlin) 450–462Lecture Notes in Computer Science, Vol. 5035Crossref, Google Scholar
• Guan Y, Miller AJ. Polynomial time algorithms for stochastic uncapacitated lot-sizing problems. Oper. Res. (2008b) 56(5):1172–1183Link, Google Scholar
• Huang K, Küçükyavuz S. On stochastic lot-sizing problems with random lead times. Oper. Res. Lett. (2008) 36(3):303–308Crossref, Google Scholar
• Levi R, Janakiraman G, Nagarajan M. A 2-approximation algorithm for stochastic inventory control models with lost sales. Math. Oper. Res. (2008a) 33(2):351–374Link, Google Scholar
• Levi R, Roundy RO, Truong VA. Provably near-optimal balancing policies for multi-echelon stochastic inventory control models. (2005) . Working paper, School of Operations Research and Information Engineering, Cornell University, Ithaca, NYGoogle Scholar
• Levi R, Pál M, Roundy RO, Shmoys DB. Approximation algorithms for stochastic inventory control models. Math. Oper. Res. (2007) 32(2):284–302Link, Google Scholar
• Levi R, Roundy R, Shmoys D, Sviridenko M. A constant approximation algorithm for the one-warehouse multiretailer problem. Management Sci. (2008b) 54(4):763–776Link, Google Scholar
• Levi R, Roundy RO, Shmoys DB, Truong VA. Approximation algorithms for capacitated stochastic inventory control models. Oper. Res. (2008c) 56(5):1184–1199Link, Google Scholar
• Motwani R, Raghavan P. Randomized Algorithms (1995) (Cambridge University Press, Cambridge, UK) Crossref, Google Scholar
• Özer Ö, Wei W. Inventory control with limited capacity and advance demand information. Oper. Res. (2004) 52(6):988–1000Link, Google Scholar
• Prandini M, Lygeros J, Nilim A, Sastry S. Randomized algorithms for probabilistic aircraft conflict detection. IEEE Conf. Decision and Control (1999) 3(IEEE, Piscataway, NJ) 2444–2449Crossref, Google Scholar
• Rust J. Using randomization to break the curse of dimensionality. Econometrica (1997) 65(3):487–516Crossref, Google Scholar
• Scarf H. The optimality of (S, s) policies in the dynamic inventory problem. Mathematical Methods in the Social Sciences (1960) (Stanford University Press, Stanford, CA) Google Scholar
• Shmoys D, Swamy C. An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM (2006) 53(6):978–1012Crossref, Google Scholar
• Shmoys D, Talwar K. A constant approximation algorithm for the a priori traveling salesman problem. Integer Programming and Combinatorial Optimization (2008) (Springer, Berlin) 331–343Lecture Notes in Computer Science, Vol. 5035Crossref, Google Scholar
• Song J, Zipkin PH. Inventory control in a fluctuating demand environment. Oper. Res. (1993) 41(2):351–370Link, Google Scholar
• Teo CP, Bertsimas D. Improved randomized approximation algorithms for lot-sizing problems. Proc. 5th Internat. IPCO Conf. Integer Programming and Combin. Optim. (1996) (Springer, Berlin) 359–373Lecture Notes in Computer ScienceCrossref, Google Scholar
• Veinott A. On the optimality of (s, S) inventory policies: New conditions and a new proof. SIAM J. Appl. Math. (1966) 14(5):1067–1083Crossref, Google Scholar