Multisourcing Supply Network Design: Two-Stage Chance-Constrained Model, Tractable Approximations, and Computational Results

References

• Aberdeen Group (2007) The challenge of multi-site warehouse and order management. Executive report. Aberdeen Group, Boston.Google Scholar
• Aboolian R, Cui T, Shen Z-JM (2013) An efficient approach for solving reliable facility location models. INFORMS J. Comput. 25(4):720–729.Link, Google Scholar
• Ackooij WV, Henrion R, Möller A, Zorgati R (2010) On probabilistic constraints induced by rectangular sets and multivariate normal distributions. Math. Methods Oper. Res. 71(3):535–549.Crossref, Google Scholar
• Ağralı S, Geunes J, Taşkın ZC (2012) A facility location model with safety stock costs: Analysis of the cost of single-sourcing requirements. J. Global Optim. 54(3):551–581.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math. Oper. Res. 23(4):769–805.Link, Google Scholar
• Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming 88(3):411–424.Crossref, Google Scholar
• Ben-Tal A, Goryashko E, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.Crossref, Google Scholar
• Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1–3):49–71.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Bertsimas D, Thiele A (2004) A robust optimization approach to supply chain management. Bienstock D, Nemhauser G, eds. Integer Programming and Combinatorial Optimization (Springer, Berlin), 86–100.Crossref, Google Scholar
• Bertsimas D, Pachamanova D, Sim M (2004) Robust linear optimization under general norms. Oper. Res. Lett. 32(6):510–516.Crossref, Google Scholar
• Birge JR, Louveaux F (1997) Introduction to Stochastic Programming (Springer, New York).Google Scholar
• Chen X, Zhang J, Zhou Y (2015) Optimal sparse designs for process flexibility via probabilistic expanders. Oper. Res. 63(5):1159–1176.Link, Google Scholar
• Chou MC, Chua GA, Teo C-P, Zheng H (2011) Process flexibility revisited: The graph expander and its applications. Oper. Res. 59(5):1090–1105.Link, Google Scholar
• Daskin MS, Coullard CR, Shen ZJM (2002) An inventory-location model: Formulation, solution algorithm and computational results. Ann. Oper. Res. 101(1–4):83–106.Crossref, Google Scholar
• Erera AL, Morales JC, Savelsbergh M (2009) Robust optimization for empty repositioning problems. Oper. Res. 57(2):468–483.Link, Google Scholar
• Henrion R, Möller A (2012) A gradient formula for linear chance constraints under Gaussian distribution. Math. Oper. Res. 37(3):475–488.Link, Google Scholar
• Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58(301):13–30.Crossref, Google Scholar
• Iravani SM, Van Oyen MP, Sims KT (2005) Structural flexibility: A new perspective on the design of manufacturing and service operations. Management Sci. 51(2):151–166.Link, Google Scholar
• Jordan WC, Graves SC (1995) Principles on the benefits of manufacturing process flexibility. Management Sci. 41(4):577–594.Link, Google Scholar
• Klabjan D, Simchi-Levi D, Song M (2013) Robust stochastic lot-sizing by means of histograms. Production Oper. Management 22(3):691–710.Crossref, Google Scholar
• Li Y, Shu J, Wang X, Xiu N, Xu D, Zhang J (2013) Approximation algorithms for integrated distribution network design problems. INFORMS J. Comput. 25(3):572–584.Link, Google Scholar
• Mahdian M, Ye Y, Zhang J (2006) Approximation algorithms for metric facility location problems. SIAM J. Comput. 36(2):411–432.Crossref, Google Scholar
• Nemirovski A, Shapiro A (2006) Convex approximations of chance constrained programs. SIAM J. Optim. 17(4):969–996.Crossref, Google Scholar
• Ozsen L, Coullard CR, Daskin MS (2008) Capacitated warehouse location model with risk pooling. Naval Res. Logist. 55(4):295–312.Crossref, Google Scholar
• Ozsen L, Daskin MS, Coullard CR (2009) Facility location modeling and inventory management with multisourcing. Transportation Sci. 43(4):455–472.Link, Google Scholar
• Prékopa A (1995) Stochastic Programming (Kluwer Academic Publishers, Dordrecht, Netherlands).Crossref, Google Scholar
• Prékopa A (2003) A Probabilistic Programming, Handbooks in Operations Research and Management Science, Vol. 10 (Elsevier, Amsterdam).Crossref, Google Scholar
• See C-T, Sim M (2010) Robust approximation to multiperiod inventory management. Oper. Res. 58(3):583–594.Link, Google Scholar
• Sethi AK, Sethi SP (1990) Flexibility in manufacturing: A survey. Internat. J. Flexible Manufacturing Systems 2(4):289–328.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).Crossref, Google Scholar
• Shen Z-JM, Coullard C, Daskin MS (2003) A joint location-inventory model. Transportation Sci. 37(1):40–55.Link, Google Scholar
• Shu J, Song M (2014) Dynamic container deployment: Two-stage robust model, complexity, and computational results. INFORMS J. Comput. 26(1):135–149.Link, Google Scholar
• Shu J, Teo C-P, Shen Z-JM (2005) Stochastic transportation-inventory network design problem. Oper. Res. 53(1):48–60.Link, Google Scholar
• Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5):1154–1157.Link, Google Scholar
• Teo C-P, Shu J (2004) Warehouse-retailer network design problem. Oper. Res. 52(3):396–408.Link, Google Scholar
• Wang X, Zhang J (2015) Process flexibility: A distribution-free bound on the performance of k-chain. Oper. Res. 63(3):555–571.Link, Google Scholar
• Zhang J (2006) Approximating the two-level facility location problem via a quasi-greedy approach. Math. Programming 108(1):159–176.Crossref, Google Scholar