Abstract
We consider stochastic control inventory models in which the goal is to coordinate a sequence of orders of a single commodity, aiming to supply stochastic demands over a discrete finite horizon with minimum expected overall ordering, holding and backlogging costs. In particular, we consider the periodic-review stochastic inventory control problem and the stochastic lot-sizing problem in the case where demands over time are correlated and non-stationary (time-dependent). In these cases, it is usually very hard to compute the optimal policy. We provide what we believe to be the first computationally efficient policies with constant worst-case performance guarantees. More specifically, we provide a general 2-approximation algorithm for the periodic-review stochastic inventory control problem and a 3-approximation algorithm for the stochastic lot-sizing problem.
Our approach is based on several novel ideas: we present a new (marginal) cost accounting for stochastic inventory models; we use cost-balancing techniques; and we consider non base-stock (order-up-to) policies that are extremely easy to implement on-line. Our results are valid for all of the currently known approaches in the literature to model correlation and non-stationarity of demands over time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertsimas, D., Thiele, A.: A robust optimization approach to supply chain management. In: Proceedings of 14th IPCO, pp. 86–100 (2004)
Chan, E.W.M.: Markov Chain Models for multi-echelon supply chains. PhD thesis, School of OR&IE, Cornell University, Ithaca, NY (January 1999)
Dean, B.C., Goemans, M.X., Vondák, J.: Approximating the stochastic knapsack problem: The benefit of adaptivity. In: Proceedings of the 45th Annual IEEE Symposium on the Foundations of Computer Science, 2004, pp. 208–217 (2004)
Dye, S., Stougie, L., Tomasgard, A.: The stochastic single resource service provision problem. Naval Research Logistics 50, 869–887 (2003)
Erkip, N., Hausman, W.H., Nahmias, S.: Optimal centralized ordering policies in multi-echelon inventory systems with correlated demands. Mangement Science 36, 381–392 (1990)
Ignall, E., Venott, A.F.: Optimality of myopic inventory policies for several substitute products. Managment Science 15, 284–304 (1969)
Iida, T., Zipkin, P.: Approximate solutions of a dynamic forecast-inventory model. Working paper (2001)
Lee, H.L., So, K.C., Tang, C.S.: The value of information sharing in two-level supply chains. Mangement Science 46, 626–643 (1999)
Levi, R., Pal, M., Roundy, R.O., Shmoys, D.B.: Approximation algorithms for stochastic inventory control models. Technical Report TR1412, ORIE Department, Cornell University, Submitted (2004)
Levi, R., Roundy, R.O., Shmoys, D.B., Troung, V.A.: Approximation algorithms for capacitated stochastic inventory control models. Working paper (2004)
Lingxiu, D., Lee, H.L.: Optimal policies and approximations for a serial multiechelon inventory system with time-correlated demand. Operations Research 51 (2003)
Lu, X., Song, J.S., Regan, A.C.: Inventory planning with forecast updates: approximate solutions and cost error bounds. Working paper (2003)
Möhring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems I: general strategies. ZOR- Zeitschrift fur Operations Research 28, 193–260 (1984)
Möhring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems II: set strategies. ZOR- Zeitschrift fur Operations Research 29, 65–104 (1984)
Möhring, R.H., Schulz, A., Uetz, M.: Approximation in stochastic scheduling: the power of LP-based priority policies. Journal of the ACM (JACM) 46, 924–942 (1999)
Muharremoglu, A., Tsitsiklis, J.N.: A single-unit decomposition approach to multi-echelon inventory systems. Working paper (2001)
Özer, Ö., Gallego, G.: Integrating replenishment decisions with advance demand information. Managment Science 47, 1344–1360 (2001)
Axsäter, S.: Simple solution procedures for a class of two-echelon inventory problems. Operations Research 38, 64–69 (1990)
Axsäter, S., Lundell, P.: In process safety stock. In: Proceedings of the 23rd IEEE Conference on Decision and Control, pp. 839–842 (1984)
Shmoys, D.B., Swamy, C.: Stochastic optimization is (almost) as easy as deterministic optimization. In: Proceedings of the 45th Annual IEEE Symposium on the Foundations of Computer Science, 2004, pp. 228–237 (2004)
Silver, E.A., Meal, H.C.: A heuristic selecting lot-size requirements for the case of a deterministic time varying demand rate and discrete opportunities for replenishment. Production and Inventory Management 14, 64–74 (1973)
Stougie, L., van der Vlerk, M.H.: Approximation in stochastic integer programming. Technical Report SOM Research Report 03A14, Eindhoven University of Technology (2003)
Veinott, A.F.: Optimal policy for a multi-product, dynamic, non-stationary inventory problem. Operations Research 12, 206–222 (1965)
Veinott, A.H.: Optimal policies with non-stationary demands. In: Scarf, H.E., Gilford, D.M., Shelly, M.W. (eds.) Multistage inventory models and techniques, pp. 85–115. Stanford University Press (1963)
Zipkin, P.H.: Foundation of inventory management. The McGraw-Hill Companies, Inc., New York (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Levi, R., Pál, M., Roundy, R., Shmoys, D.B. (2005). Approximation Algorithms for Stochastic Inventory Control Models. In: Jünger, M., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization. IPCO 2005. Lecture Notes in Computer Science, vol 3509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496915_23
Download citation
DOI: https://doi.org/10.1007/11496915_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26199-5
Online ISBN: 978-3-540-32102-6
eBook Packages: Computer ScienceComputer Science (R0)