Approximation algorithms for stochastic inventory control models

Mathematics of Operations Research

Volumn 32, Issue 2, 2007, Pages 284-302

  Levi, Retsef ^a   Pal, Martin ^b   Roundy, Robin O ^c   Shmoys, David B ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b GOOGLE INC   (United States)

^c Cornell University   (United States)

Author keywords

Algorithms; Approximation; Dual balancing; Inventory

Indexed keywords

BACKLOGGING COSTS; DUAL BALANCING;

INVENTORY CONTROL; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES; SUPPLY CHAIN MANAGEMENT;

APPROXIMATION ALGORITHMS;

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

References (31)

1. Axsäter, S. 1990. Simple solution procedures for a class of two-echelon inventory problems. Oper. Res. 38 64-69.
2. Axsäter, S., P. Lundell. 1984. In process safety stock. Proc. 23rd IEEE Conf Decision Control, Lecture Notes in Computer Science, Springer, Heidelberg, Germany, 839-842.
3. Bertsimas, D., A. Thiele. 2004. A robust optimization approach to supply chain management. Proc. 14th IPCO, Lecture Notes in Computer Science, Springer, Heidelberg, Germany, 86-100.
4. Chan, E. W. M. 1999. Markov chain models for multi-echelon supply chains. Ph.D. thesis, Cornell University, Ithaca, NY
5. Chan, E. W. M., J. Muckstadt. 1999. Markov chain models for multi-echelon supply chains. Unpublished manuscript.
6. Chen, F., J. Song. 2001. Optimal policies for multi-echelon inventory problems with Markov-modulated demand. Oper. Res. 49 226-234.
7. Dean, B. C., M. X. Goemans, J. Vondrák. 2004. Approximating the stochastic knapsack problem: The benefit of adaptivity. Proc. 45th Annual IEEE Sympos. Foundations Comput. Sci., IEEE Computer Society, Washington, D.C., 208-217.
8. Dong, L., H. L. Lee. 2003. Optimal policies and approximations for a serial multiechelon inventory system with time-correlated demand. Oper. Res. 51 969-980.
9. Dye, S., L. Stougie, A. Tomasgard. 2003. The stochastic single resource service provision problem. Naval Res. Logist. 50 869-887.
10. Erkip, N., W. H. Hausman, S. Nahmias. 1990. Optimal centralized ordering policies in multi-echelon inventory systems with correlated demands. Management Sci. 36 381-392.
11. Gallego, G., Ö. Özer. 2001. Integrating replenishment decisions with advanced demand information. Management Sci. 47 1344-1360.
12. Halman, N., D. Klabjan, M. Mostagir, J. Orling. 2006. A fully polynomial time approximation scheme for single-item stochastic lot-sizing problems with discrete demands. Working paper, MIT, Boston, MA.
13. Hurley, G., P. Jackson, R. Levi, R. O. Roundy, D. B. Shmoys. 2005. New policies for stochastic inventory control models-theoretical and computational results. Submitted.
14. Ignall, E., A. F. Veinott. 1969. Optimality of myopic inventory policies for several substitute products. Management Sci. 15 284-304.
15. Iida, T., P. H. Zipkin. 2006. Approximate solutions of a dynamic forecast-inventory model. Manufacturing Service Oper. Management 8 407-425.
16. Joneja, D. 1990. The joint replenishment problem: New heuristics and worst-case performance bounds. Oper. Res. 38 723-771.
17. Lee, H. L., K. C. So, C. S. Tang. 1999. The value of information sharing in two-level supply chains. Management Sci. 46 626-643.
18. Levi, R., R. O. Roundy, V. A. Truong. 2005. Provably near-optimal balancing policies for multi-echelon stochastic inventory control models. Submitted.
19. Levi, R., R. O. Roundy, D. B. Shmoys, V. A. Truong. 2004. Approximation algorithms for capacitated stochastic inventory control models. Submitted.
20. Lu, X., J. S. Song, A. C. Regan. 2003. Inventory planning with forecast updates: Approximate solutions and cost error bounds. Oper. Res. Forthcoming.
21. Möhring, R. H., F. J. Radermacher, G. Weiss. 1984. Stochastic scheduling problems I: General strategies. ZOR-Zeitschrift Oper. Res. 28 193-260.
22. Möhring, R. H., F. J. Radermacher, G. Weiss. 1984. Stochastic scheduling problems II: Set strategies. ZOR-Zeitschrift Oper. Res. 29 65-104.
23. Möhring, R. H., A. Schulz, M. Uetz. 1999. Approximation in stochastic scheduling: The power of LP-based priority policies. J. ACM 46 924-942.
24. Muharremoglu, A., J. N. Tsitsiklis. 2001. A single-unit decomposition approach to multi-echelon inventory systems. Working paper, Columbia University, New York.
25. Özer, Ö., G. Gallego. 2001. Integrating replenishment decisions with advance demand information. Management Sci. 47 1344-1360.
26. Shmoys, D. B., C. Swamy. 2004. Stochastic optimization is (almost) as easy as deterministic optimization. Proc. 45th Annual IEEE Sympos. Foundations Comput. Sci., IEEE Computer Society, Washington, D.C., 228-237.
27. Silver, E. A., H. C. Meal. 1973. A heuristic selecting lot-size requirements for the case of a deterministic time varying demand rate and discrete opportunities for replenishment. Production Inventory Management 14 64-74.
28. Song, J., P. Zipkin. 1993. Inventory control in a fluctuating demand environment. Oper. Res. 41 351-370.
29. Stougie, L., M. H. van der Vlerk. 2003. Approximation in stochastic integer programming. Technical report, SOM Research Report 03A14, Eindhoven University of Technology, Eindhoven, The Netherlands.
30. Veinott, A. F. 1965. Optimal policy for a multi-product, dynamic, non-stationary inventory problem. Management Sci. 12 206-222.
31. Zipkin, P. H. 2000. Foundations of Inventory Management. McGraw-Hill, New York.