Closed-Loop Supply Chain Network Design Under Demand and Return Uncertainty

References

• Akçali E, Çetinkaya S, Üster H (2009) Network design for reverse and closed-loop supply chains: An annotated bibliography of models and solution approaches. Networks 53(3):231–248.Crossref, Google Scholar
• Batun S, Denton BT, Huschka TR, Schaefer AJ (2011) Operating room pooling and parallel surgery processing under uncertainty. INFORMS J. Comput. 23(2):220–237.Link, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252.Crossref, Google Scholar
• Beullens P (2004) Reverse logistics in effective recovery of products from waste materials. Rev. Environ. Sci. Biotechnology 3(4):283–306.Crossref, Google Scholar
• Birge JR, Louveaux F (1997) Introduction to Stochastic Programming (Springer, New York).Google Scholar
• Birge JR, Louveaux FV (1988) A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34(3):384–392.Crossref, Google Scholar
• Crainic TG, Fu X, Gendreau M, Rei W, Wallace SW (2011) Progressive hedging-based metaheuristics for stochastic network design. Networks 58(2):114–124.Crossref, Google Scholar
• Easwaran G, Üster H (2009) Tabu search and Benders decomposition approaches for a capacitated closed-loop supply chain network design problem. Transportation Sci. 43(3):301–320.Link, Google Scholar
• Easwaran G, Üster H (2010) A closed-loop supply chain network design problem with integrated forward and reverse channel decisions. IIE Trans. 42(11):779–792.Crossref, Google Scholar
• Fleischmann M, Beullens P, Bloemhof-Ruwaard JM, Van Wassenhove L (2001) The impact of product recovery on logistics network design. Production Oper. Management 10(2):156–173.Crossref, Google Scholar
• Gale D (1957) A theorem on flows in networks. Pacific J. Math. 7:1073–1082.Crossref, Google Scholar
• Guide VDR, Van Wassenhove LN (2001) Managing product returns and remanufacturing. Production Oper. Management 10(2):142–155.Crossref, Google Scholar
• Guide VDR, Van Wassenhove LN (2009) The evolution of closed-loop supply chain research. Oper. Res. 57(1):10–18.Link, Google Scholar
• Guide VDR, Souza GC, Van Wassenhove LN, Blackburn JD (2006) Time value of commercial product returns. Management Sci. 52(8):1200–1214.Link, Google Scholar
• Hoffman AJ (1960) Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Bellman R, Hall M Jr, eds. Proc. Symposia Appl. Math., Vol. 10 (AMS, Providence, RI), 113–127.Crossref, Google Scholar
• Kaut M, Wallace SW (2007) Evaluation of scenario-generation methods for stochastic programming. Pacific J. Optim. 3(2):257–271.Google Scholar
• King AJ, Wallace SW (2012) Modeling with Stochastic Programming (Springer, New York).Crossref, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Laporte G, Louveaux FV, van Hamme L (1994) Exact solution to a location problem with stochastic demands. Transportation Sci. 28(2):95–103.Link, Google Scholar
• Lee D, Dong M (2009) Dynamic network design for reverse logistics operations under uncertainty. Transportation Res. Part E 45:61–71.Crossref, Google Scholar
• Linderoth J, Shapiro A, Wright S (2006) The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142(1):215–241.Crossref, Google Scholar
• Listes O (2007) A generic stochastic model for supply-and-return network design. Comput. Oper. Res. 34:417–442.Crossref, Google Scholar
• Listes O, Dekker R (2005) A stochastic approach to a case study for product recovery network design. Eur. J. Oper. Res. 160:268–287.Crossref, Google Scholar
• Lium A, Crainic TG, Wallace SW (2009) A study of demand stochasticity in service network design. Transportation Sci. 43(2):144–157.Link, Google Scholar
• Maggioni F, Wallace SW (2012) Analyzing the quality of the expected value solution in stochastic programming. Ann. Oper. Res. 200:37–54.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
• Pishvaee MS, Jolai F, Razmi J (2009) A stochastic optimization model for integrated forward/reverse logistics network design. J. Manufacturing Systems 28:107–114.Crossref, Google Scholar
• Sahyouni K, Savaskan RC, Daskin M (2007) A facility location model for bidirectional flows. Transportation Sci. 41(4):484–499.Link, Google Scholar
• Salema MIG, Barbosa-Povoa AP, Novais AQ (2007) An optimization model for the design of a capacitated multi-product reverse logistics network with uncertainty. Eur. J. Oper. Res. 179(3):1063–1077.Crossref, Google Scholar
• Üster H, Kewcharoenwong P (2011) Strategic design and analysis of a relay network in truckload transportation. Transportation Sci. 45(4):505–523.Link, Google Scholar
• Üster H, Easwaran G, Akçali E, Çetinkaya S (2007) Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model. Naval Res. Logist. 54(8):890–907.Crossref, Google Scholar
• Van Roy TJ (1986) A cross decomposition algorithm for capacitated facility location. Oper. Res. 34(1):145–163.Link, Google Scholar
• Van Slyke RM, Wets R (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4):638–663.Crossref, Google Scholar
• Wallace SW, Wets RJ (1989) Preprocessing in stochastic programming: The case of uncapacitated networks. ORSA J. Comput. 1(4):252–270.Link, Google Scholar
• Wallace SW, Wets RJ (1995) Preprocessing in stochastic programming: The case of capacitated networks. ORSA J. Comput. 7(1):44–62.Link, Google Scholar
• Zhang M, Küçükyavuz S (2014) Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs. SIAM J. Optim. 24(4):1933–1951.Crossref, Google Scholar