A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand

Mathematics of Operations Research

Volumn 34, Issue 3, 2009, Pages 674-685

  Halman, Nir ^a,b   Klabjan, Diego ^c   Mostagir, Mohamed ^d   Orlin, Jim ^e   Simchi Levi, David ^a  

^a Massachusetts Institute of Technology   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c Northwestern University   (United States)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^e MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Stochastic dynamic programming; Stochastic inventory management

Indexed keywords

DISCRETE DEMAND; FINITE TIME HORIZON; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; INVENTORY REPLENISHMENT; PERIODIC REVIEW; STOCHASTIC DEMAND; STOCHASTIC DYNAMIC PROGRAMMING; STOCHASTIC INVENTORY; STOCHASTIC INVENTORY MANAGEMENT;

DYNAMIC PROGRAMMING; INVENTORY CONTROL; POLYNOMIAL APPROXIMATION; RESOURCE VALUATION; SYSTEMS ENGINEERING;

APPROXIMATION ALGORITHMS;

EID: 70349289793     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1090.0391     Document Type: Article

References (26)

1. Dean, B. C., M. X. Goemans, J. Vondrák. 2008. Approximating the stochastic knapsack problem: The benefit of adaptivity. Math. Oper. Res. 33 945-964.
2. Dyer, M. 2003. Approximate counting by dynamic programming. Proc. 35th Annual Sympos. Theory Comput., ACM, New York, 693-699.
3. Dyer, M., A. Frieze, M. Jerrum. 1998. Approximately counting Hamilton paths and cycles in dense graphs. SIAM J. Comput. 27 1262-1272.
4. Dyer, M., L. A. Goldberg, C. Greenhill, M. Jerrum. 2003. The relative complexity of approximate counting problems. Algorithmica 38 471-500.
5. Federgruen, A., P. H. Zipkin. 1984. Computational issues in an infinite-horizon, multi-echelon inventory model. Oper. Res. 32 818-836.
6. Federgruen, A., P. H. Zipkin. 1984. An efficient algorithm for computing optimal (s, S) policies. Oper. Res. 32 1268-1286.
7. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.
8. Jerrum, M., A. Sinclair. 1989. Approximating the permanent. SIAM J. Comput. 18 1149-1178.
9. Jerrum, M., A. Sinclair, E. Vigoda. 2004. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51(4) 671-697.
10. Levi, R., R. Roundy, D. B. Shmoys. 2007. Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32 821-838.
11. Levi, R., M. Pal, R. Roundy, D. B. Shmoys. 2007. Approximation algorithms for stochastic inventory control models. Math. Oper. Res. 32 284-302.
12. Levi, R., R. Roundy, D. B. Shmoys, V. A. Truong. 2008. Approximation algorithms for capacitated stochastic inventory control problems. Oper. Res. 56 1186-1199.
13. Mihail, M., P. Winkler. 1995. On the number of Eulerian orientations of a graph. Algorithmica 16 402-414.
14. Porteus, E. L. 2002. Foundations of Stochastic Inventory Theory. Stanford University Press, Stanford, CA.
15. Preparata, F. P., M. I. Shamos. 1985. Computational Geometry: An Introduction. Springer-Verlag, New York.
16. Roth, D. 1996. On the hardness of approximate reasoning. Artificial Intelligence 82 273-302.
17. Roundy, R., J. A. Muckstadt. 2000. Heuristic computation of periodic-review base stock inventory policies. Management Sci. 46 104-109.
18. Safer, H., J. Orlin. 1995. Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems. Working Paper 3757-3795, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA.
19. Shmoys, D. B., C. Swamy. 2006. An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53 973-1012.
20. Simchi-Levi, D., X. Chen, J. Bramel. 2005. The Logic of Logistics: Theory, Algorithms, and Applications for Logistics and Supply Chain Management, 2nd ed. Springer-Verlag, New York.
21. Swamy, C., D. B. Shmoys. 2005. Sampling-based approximation algorithms for multi-stage stochastic optimization. 46th Annual IEEE Sympos. Foundations Comput. Sci., Pittsburgh, 357-366.
22. Van Hoesel, C. P. M., A. P. M. Wagelmans. 2001. Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Math. Oper. Res. 26 339-357.
23. Weitz, D. 2006. Counting independent sets up to the tree threshold. Proc. 38th Annual Sympos. Theory Comput., ACM, New York, 140-149.
24. Woeginger, G. J. 2000. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS J. Comput. 12 57-75.
25. Zheng, Y. Z., A. Federgruen. 1991. Finding optimal (s,S) policies is about as simple as evaluating a single policy. Oper. Res. 39 654-665.
26. Zipkin, P. H. 2000. Foundations of Inventory Management. McGraw-Hill, Burr Ridge, IL.