Approximation algorithms for the stochastic lot-sizing problem with order lead times

Operations Research

Volumn 61, Issue 3, 2013, Pages 593-602

  Levi, Retsef ^a   Shi, Cong ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Approximation algorithms; Inventory; Randomized cost balancing; Stochastic lot sizing

Indexed keywords

COMPUTATIONAL EXPERIMENT; INVENTORY; NEAR-OPTIMAL POLICIES; PERFORMANCE ANALYSIS TECHNIQUES; RANDOMIZED ALGORITHMS; STOCHASTIC INVENTORY CONTROL MODELS; STOCHASTIC LOT-SIZING; WORST-CASE PERFORMANCE;

APPROXIMATION ALGORITHMS; INVENTORY CONTROL; OPTIMIZATION; STOCHASTIC SYSTEMS;

STOCHASTIC MODELS;

EID: 84880068549     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.2013.1162     Document Type: Article

References (27)

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