Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution

References

• Absi N, Kedad-Sidhoum S, Dauzère-Pérès S (2011) Uncapacitated lot-sizing problem with production time windows, early productions, backlogs, and lost sales. Internat. J. Production Res. 49(9):2551–2566.Crossref, Google Scholar
• Adulyasak Y, Cordeau JF, Jans R (2015) Benders decomposition for production routing under demand uncertainty. Oper. Res. 63(4):851–867.Link, Google Scholar
• Aloulou MA, Dolgui A, Kovalyov MY (2014) A bibliography of non-deterministic lot-sizing models. Internat. J. Production Res. 52(8):2293–2310.Crossref, Google Scholar
• Arkin E, Joneja D, Roundy R (1989) Computational complexity of uncapacitated multi-echelon production planning problems. Oper. Res. Lett. 8(2):61–66.Crossref, Google Scholar
• Balakrishnan A, Geunes J (2000) Requirements planning with substitutions: Exploiting bill-of-materials flexibility in production planning. Manufacturing Service Oper. Management 2(2):166–185.Link, Google Scholar
• Begnaud J, Benjaafar S, Miller LA (2009) The multi-level lot sizing problem with flexible production sequences. IIE Trans. 41(8):702–715.Crossref, Google Scholar
• Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer, New York).Crossref, Google Scholar
• Bookbinder JH, Tan JY (1988) Strategies for the probabilistic lot-sizing problem with service-level constraints. Management Sci. 34(9):1096–1108.Link, Google Scholar
• Brahimi N, Absi N, Dauzère-Pérès S, Nordli A (2017) Single-item dynamic lot-sizing problems: An updated survey. Eur. J. Oper. Res. 263(3):838–863.Crossref, Google Scholar
• Brandimarte P (2006) Multi-item capacitated lot-sizing with demand uncertainty. Internat. J. Production Res. 44(15):2997–3022.Crossref, Google Scholar
• Buschkühland L, Sahling F, Helber S, Tempelmeier H (2010) Dynamic capacitated lot-sizing problems: A classification and review of solution approaches. OR Spectrum 32(2):231–261.Google Scholar
• Cecere L (2015) Does better forecasting improve inventory? Why I don’t think so anymore. Forbes Online (November 29), https://www.forbes.com/sites/loracecere/2015/11/29/does-better-forecasting-improve-inventory-why-i-dont-think-so-anymore/amp/.Google Scholar
• Chan AT, Ngai EW, Moon KK (2017) The effects of strategic and manufacturing flexibilities and supply chain agility on firm performance in the fashion industry. Eur. J. Oper. Res. 259(2):486–499.Crossref, Google Scholar
• Crainic TG, Rei W, Hewitt M, Maggioni F (2016) Partial Benders decomposition strategies for two-stage stochastic integer programs. Technical Report, CIRRELT-2016-37, Université de Montréal, Canada.Google Scholar
• Cranley R, Patterson TNL (1976) Randomization of number theoretic methods for multiple integration. SIAM J. Numerical Anal. 13(6):904–914.Crossref, Google Scholar
• De Matos VL, Philpott AB, Finardi EC (2015) Improving the performance of stochastic dual dynamic programming. J. Comput. Appl. Math. 290:196–208.Crossref, Google Scholar
• Dowson O, Philpott A, Mason A, Downward A (2019) A multi-stage stochastic optimization model of a pastoral dairy farm. Eur. J. Oper. Res. 274(3):1077–1089.Crossref, Google Scholar
• Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper. Res. 26(6):992–1009.Link, Google Scholar
• Firoozi M, Babai MZ, Klibi W, Ducq Y (2020) Distribution planning for multi-echelon networks considering multiple sourcing and lateral transshipments. Internat. J. Production Res. 58(7):1968–1986.Crossref, Google Scholar
• Freeman NK, Narayanan A, Keskin BB (2020) Optimal use of downward substitution in a manufacturing operation subject to uncertainty. Omega 103:102372.Crossref, Google Scholar
• Gallego G, Katircioglu K, Ramachandran B (2006) Semiconductor inventory management with multiple grade parts and downgrading. Production Planning Control 17(7):689–700.Crossref, Google Scholar
• Geunes J (2003) Solving large-scale requirements planning problems with component substitution options. Comput. Indust. Engrg. 44(3):475–491.Crossref, Google Scholar
• Grubbström RW, Wang Z (2003) A stochastic model of multi-level/multi-stage capacity-constrained production–inventory systems. Internat. J. Production Econom. 81–82:483–494.Crossref, Google Scholar
• Han G, Dong M, Liu S (2014) Yield and allocation management in a continuous make-to-stock system with demand upgrade substitution. Internat. J. Production Econom. 156:124–131.Crossref, Google Scholar
• Harris FW (1990) How many parts to make at once. Oper. Res. 38(6):947–950.Link, Google Scholar
• Haugen KK, Løkketangen A, Woodruff DL (2001) Progressive hedging as a meta-heuristic applied to stochastic lot-sizing. Eur. J. Oper. Res. 132(1):116–122.Crossref, Google Scholar
• Hsu A, Bassok Y (1999) Random yield and random demand in a production system with downward substitution. Oper. Res. 47(2):277–290.Link, Google Scholar
• Huang D, Zhou H, Zhao QH (2011) A competitive multiple-product newsboy problem with partial product substitution. Omega 39(3):302–312.Crossref, Google Scholar
• Jans R, Degraeve Z (2008) Modeling industrial lot sizing problems: A review. Internat. J. Production Res. 46(6):1619–1643.Crossref, Google Scholar
• Karimi B, Ghomi SF, Wilson J (2003) The capacitated lot sizing problem: A review of models and algorithms. Omega 31(5):365–378.Crossref, Google Scholar
• Lang JC, Domschke W (2010) Efficient reformulations for dynamic lot-sizing problems with product substitution. OR Spectrum 32(2):263–291.Crossref, Google Scholar
• L’Ecuyer P, Munger D (2016) Algorithm 958: Lattice builder: A general software tool for constructing rank-1 lattice rules. ACM Trans. Math. Software 42(2):15.Crossref, Google Scholar
• Lohmann T, Hering AS, Rebennack S (2016) Spatio-temporal hydro forecasting of multireservoir inflows for hydro-thermal scheduling. Eur. J. Oper. Res. 255(1):243–258.Crossref, Google Scholar
• Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464–484.Link, Google Scholar
• Metropolis N, Ulam S (1949) The Monte Carlo method. J. Amer. Statist. Assoc. 44(247):335–341.Crossref, Google Scholar
• Pacaud F, Carpentier P, Chancelier JP, De Lara M (2018) Stochastic optimal control of a domestic microgrid equipped with solar panel and battery. Preprint, submitted January 19, https://arxiv.org/abs/1801.06479.Google Scholar
• Papadakos N (2008) Practical enhancements to the Magnanti–Wong method. Oper. Res. Lett. 36(4):444–449.Crossref, Google Scholar
• Parpas P, Ustun B, Webster M, Tran QK (2015) Importance sampling in stochastic programming: A Markov chain Monte Carlo approach. INFORMS J. Comput. 27(2):358–377.Link, Google Scholar
• Pereira MV, Pinto LM (1991) Multi-stage stochastic optimization applied to energy planning. Math. Programming 52(1):359–375.Crossref, Google Scholar
• Piperagkas GS, Konstantaras I, Skouri K, Parsopoulos KE (2012) Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics. Comput. Oper. Res. 39(7):1555–1565.Crossref, Google Scholar
• Quezada F, Gicquel C, Kedad-Sidhoum S (2019) Stochastic dual dynamic integer programming for a multi-echelon lot-sizing problem with remanufacturing and lost sales. Elloumi S, Fanti MP, Telmoudi AJ, Viedma EH, eds. 6th Internat. Conf. Control Decision Inform. Tech. (CoDIT) (IEEE, Paris), 1254–1259.Google Scholar
• Quezada F, Gicquel C, Kedad-Sidhoum S (2021) Combining polyhedral approaches and stochastic dual dynamic integer programming for solving the uncapacitated lot-sizing problem under uncertainty. INFORMS J. Comput. 34(2):1024–1041.Google Scholar
• Quezada F, Gicquel C, Kedad-Sidhoum S, Vu DQ (2020) A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales. Comput. Oper. Res. 116:104865.Crossref, Google Scholar
• Rao US, Swaminathan JM, Zhang J (2004) Multi-product inventory planning with downward substitution, stochastic demand and setup costs. IIE Trans. 36(1):59–71.Crossref, Google Scholar
• Rockafellar RT, Wets RJB (1991) Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16(1):119–147.Link, Google Scholar
• Santoso T, Ahmed S, Goetschalckx M, Shapiro A (2005) A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167(1):96–115.Crossref, Google Scholar
• Shapiro A (2011) Analysis of stochastic dual dynamic programming method. Eur. J. Oper. Res. 209(1):63–72.Crossref, Google Scholar
• Shin H, Park S, Lee E, Benton W (2015) A classification of the literature on the planning of substitutable products. Eur. J. Oper. Res. 246(3):686–699.Crossref, Google Scholar
• Soares MP, Street A, Valladão DM (2017) On the solution variability reduction of stochastic dual dynamic programming applied to energy planning. Eur. J. Oper. Res. 258(2):743–760.Crossref, Google Scholar
• Sox CR (1997) Dynamic lot sizing with random demand and non-stationary costs. Oper. Res. Lett. 20(4):155–164.Crossref, Google Scholar
• Sreedevi R, Saranga H (2017) Uncertainty and supply chain risk: The moderating role of supply chain flexibility in risk mitigation. Internat. J. Production Econom. 193:332–342.Crossref, Google Scholar
• Tarim SA, Kingsman BG (2006) Modelling and computing (Rn, Sn) policies for inventory systems with non-stationary stochastic demand. Eur. J. Oper. Res. 174(1):581–599.Crossref, Google Scholar
• Tarim SA, Dogru MK, Özen U, Rossi R (2011) An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints. Eur. J. Oper. Res. 215(3):563–571.Crossref, Google Scholar
• Tempelmeier H (2013) Stochastic lot sizing problems. Smith JM, Tan B, eds. Handbook of Stochastic Models and Analysis of Manufacturing System Operations (Springer, Berlin), 313–344.Crossref, Google Scholar
• Tempelmeier H, Derstroff M (1996) A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Sci. 42(5):738–757.Link, Google Scholar
• Tempelmeier H, Hilger T (2015) Linear programming models for a stochastic dynamic capacitated lot sizing problem. Comput. Oper. Res. 59:119–125.Crossref, Google Scholar
• Thevenin S, Adulyasak Y, Cordeau JF (2021) Material requirements planning under demand uncertainty using stochastic optimization. Production Oper. Management 30(2):475–493.Crossref, Google Scholar
• Tunc H, Kilic OA, Tarim SA, Rossi R (2018) An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem. INFORMS J. Comput. 30(3):492–506.Link, Google Scholar
• Valladão D, Silva T, Poggi M (2019) Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns. Ann. Oper. Res. 282(1):379–405.Crossref, Google Scholar
• Wei M, Qi M, Wu T, Zhang C (2019) Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials. Eur. J. Oper. Res. 277(2):521–541.Crossref, Google Scholar
• Wu T, Akartunali K, Jans R, Liang Z (2017) Progressive selection method for the coupled lot-sizing and cutting-stock problem. INFORMS J. Comput. 29(3):523–543.Link, Google Scholar
• Yaman H (2009) Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution. Discrete Appl. Math. 157(14):3133–3151.Crossref, Google Scholar