×

Provably near-optimal balancing policies for multi-echelon stochastic inventory control models. (English) Zbl 1359.90011

Summary: We develop the first algorithmic approach to compute provably good ordering policies for a multi-echelon, stochastic inventory system facing correlated, nonstationary and evolving demands over a finite horizon. Specifically, we study the serial system. Our approach is computationally efficient and provides worst-case guarantees. That is, the expected cost of the algorithms is guaranteed to be within a constant factor of the optimal expected cost; depending on the assumption the constant varies between two and three. Our algorithmic approach is based on an innovative scheme to account for costs in a multi-echelon, multi-period environment, as well as repeatedly balancing between opposing cost. The cost-accounting scheme, called a cause-effect cost-accounting scheme, is significantly different from traditional cost-accounting schemes in that it reallocates costs with the goal of assigning every unit of cost to the decision that caused the cost to be incurred. We believe it will have additional applications in other multi-echelon inventory models.

MSC:

90B05 Inventory, storage, reservoirs
90C59 Approximation methods and heuristics in mathematical programming
Full Text: DOI

References:

[1] Bessler S, Veinott A Jr (1966) Optimal policy for a dynamic multi-echelon inventory model. Naval Res. Logist. Quart. 13(4):355-389. CrossRef · Zbl 0154.19901
[2] Chan EWM (1999) Markov chain models for multi-echelon supply chains. PhD thesis, School of OR&IE, Cornell University, Ithaca, NY.
[3] Chao X, Zhou SX (2007) Probabilistic solution and bounds for serial inventory system with discounted and average cost. Naval Res. Logist. 54(6):623-631. CrossRef · Zbl 1151.90306
[4] Chao X, Zhou SX (2007) Probabilistic solution and bounds for serial inventory systems with discounted and average costs. Naval Res. Logist. 54(6):623-631. CrossRef · Zbl 1151.90306
[5] Chen F, Song J (2001) Optimal policies for multi-echelon inventory problems with Markov-modulated demand. Oper. Res. 49(2):226-234. Link · Zbl 1163.90322
[6] Chen F, Zheng Y (1994) Lower bounds for multi-echelon stochastic inventory systems. Management Sci. 40(11):1426-1443. Link · Zbl 0823.90034
[7] Clark A, Scarf H (1960) Optimal policies for a multiechelon inventory problem. Management Sci. 6(4):475-490. Link
[8] Dong L, Lee HL (2003) Optimal policies and approximations for a serial multiechelon inventory system with time-correlated demand. Oper. Res. 51(6):969-980. Link · Zbl 1165.90312
[9] Federgruen A, Zipkin P (1984) Computational issues in an infinite-horizon multi-echelon inventory model. Oper. Res. 32(4):818-836. Link · Zbl 0546.90026
[10] Iida T (2001) The infinite horizon non-stationary stochastic multi-echelon inventory problem and near-myopic policies. Eur. J. Oper. Res. 134(3):525-539. CrossRef · Zbl 0984.90004
[11] Iida T, Zipkin P (2006) Approximate solutions of a dynamic forecast-inventory model. Manufacturing Service Oper. Management 8(4):407-425. Link
[12] Janakiraman G, Muckstadt JA (2003) A decomposition approach for a capacitated singel-stage inventory system. Technical report TR1360, ORIE Department, Cornell University, Ithaca, NY.
[13] Janakiraman G, Roundy RO (2004) Lost-sales problems with stochastic lead times: Convexity results for base-stock policies. Oper. Res. 52(5):785-803. Link · Zbl 1165.90322
[14] Levi R, Janakiraman G, Nagarajan M (2008) A 2-approximation algorithm for stochastic inventory control models with lost sales. Math. Oper. Res. 33(2):351-374. Link · Zbl 1231.90045
[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. Link · Zbl 1279.90011
[16] Levi R, Roundy RO, Shmoys DB, Truong VA (2008) Approximation algorithms for capacitated stochastic inventory control models. Oper. Res. 56(5):1184-1199. Link · Zbl 1167.90339
[17] Levi R, Shi C (2013) Approximation algorithms for the stochastic lot-sizing problem with order lead times. Oper. Res. 61(3):593-602. Link · Zbl 1273.90014
[18] Muharremoglu A, Tsitsiklis JN (2008) A single-unit decomposition approach to multiechelon inventory systems. Oper. Res. 56(5):1089-1103. Link · Zbl 1167.90348
[19] Gallego G, Özer Ö (2005) A new algorithm and a new heuristic for serial supply systems. Oper. Res. Lett. 33(4):349-362. CrossRef · Zbl 1090.90001
[20] Rosling K (1989) Optimal inventory policies for assembly systems under random demands. Oper. Res. 37(4):565-579. Link · Zbl 0677.90025
[21] Shang HK, Song J (2003) Newsvendor bounds and heuristic for optimal policies in serial supply chains. Management Sci. 49(5):618-638. Link · Zbl 1232.90090
[22] Song J, Zipkin P (1993) Inventory control in a fluctuating demand environment. Oper. Res. 41(2):351-370. Link · Zbl 0798.90035
[23] Yu Q (2010) Evaluation of cost balancing policies in multi-echelon stochastic inventory control problems. Technical Report, Massachusetts Institute of Technology, Cambridge, MA.
[24] Zipkin PH (2000) Foundations of Inventory Management (The McGraw-Hill Companies., New York).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.