Bounds of relative regret limit in p-robust supply chain network design

Production and Operations Management

Volumn 23, Issue 10, 2014, Pages 1811-1831

  Tian, Junfeng ^a   Yue, Jinfeng ^b,c  

^a SOUTHWESTERN UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^b SHANGHAI UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^c MIDDLE TENNESSEE STATE UNIVERSITY   (United States)

Author keywords

regret; robust optimization; stochastic programming; supply chain design

Indexed keywords

EID: 84914703395     PISSN: 10591478     EISSN: 19375956     Source Type: Journal    
DOI: 10.1111/poms.12187     Document Type: Article

References (43)

1. Alonso-Ayuso, A., L. F. Escudero, A. Garin, M. T. Ortuno, and, G. Perez,. 2003. An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming. J. Global Optimiz. 26: 97-124.
2. Agarwal, Y. K., 2002. Design of capacitated multicommodity networks with multiple facilities. Oper. Res. 50 (2): 333-344.
3. Atamtürk, A., M. Zhang,. 2007. Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55 (4): 662-673.
4. Averbakh, I., 2003. Complexity of robust single facility location problems on networks with uncertain edge lengths. Discr. Appl. Math. 127 (3): 505-522.
5. Averbakh, I., S. Bereg,. 2005. Facility location problems with uncertainty on the plane. Discr. Optimiz. 2: 3-34.
6. Averbakh, I., O. Berman,. 2000a. Minmax regret median location on a network under uncertainty. INFORMS J. Comput. 12 (2): 104-110.
7. Averbakh, I., O. Berman,. 2000b. Algorithms for the robust 1-center problem on a tree. Eur. J. Oper. Res. 123 (2): 292-302.
8. Benders, J. F., 1962. Partitioning procedures for solving mixed variables programming problems. Numersiche Mathematik 4: 238-252.
9. Berman, O., J. Wang, Z. Drezner, and, C. O. Wesolowsky,. 2003. The minimax and maximin location problems on a network with uniform distributed weights. IIE Trans. 35 (11): 1017-1025.
10. Brandeau, M. L., S. S. Chiu,. 1989. An overview of representative problems in location research. Manage. Sci. 35 (6): 645-674.
11. Camm J. D., T. Chorman, F. Dill, J. Evans, D. Sweeney, G. Wegryn,. 1997. Blending OR/MS, judgment, and GIS: restructuring P&G's supply chain. Interfaces 27 (1): 128-142
12. Chen, B., C. Lin,. 1998. Robust one-median location problem. Networks 31: 93-103.
13. Conde, E., 2007. Minmax regret location-allocation problem on a network under uncertainty. Eur. J. Oper. Res. 179: 1025-1039.
14. Cordeau J. F., F. Pasin, M. M. Solomon,. 2006. An integrated model for logistics network design. Ann. Oper. Res. 144: 59-82.
15. Frank M., P. Wolfe,. 1956. An algorithm for quadratic programming. Nav. Res. Log. Q. 3 (1-2): 95-110.
16. Ghamlouche, I., T. G. Crainic, M. Gendreau,. 2003. Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51 (4): 655-667.
17. Gutiérrez, G. J., and, P. Kouvelis,. 1995. A robustness approach to international sourcing. Ann. Oper. Res. 59: 165-193.
18. Gutiérrez, G. J., P. Kouvelis, and, A. A. Kurawarwala,. 1996. A robustness approach to uncapacitated network design problems. Eur. J. Oper. Res. 94: 362-376.
19. Holmberg, K., J. Hellstrand,. 1998. Solving the uncapacitated network design problem by a lagrangean heuristic and branch-and-bound. Oper. Res. 46 (2): 247-259.
20. Holmberg, K., D. Yuan,. 2000. A lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48 (3): 461-481.
21. Kara, S. S., S. Onut,. 2010. A two-stage stochastic and robust programming approach to strategic planning of a reverse supply network: The case of paper recycling. Expert Syst. Appl. 37 (9): 6129-6137.
22. Klibi, W., A. Martel, A. Guitouni,. 2010. The design of robust value-creating supply chain networks: A critical review. Eur. J. Oper. Res. 203: 283-293.
23. Kouvelis, P., A. A. Kurawarwala, and, G. J. Gutiérrez,. 1992. Algorithms for robust single and multiple period layout planning for manufacturing systems. Eur. J. Oper. Res. 63: 287-303.
24. Kouvelis, P., G. Vairaktarakis, G. Yu,. 1994. Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty. Working paper 93/94-3-4, Department of Management Science and Information Systems, Graduate School of Business, The University of Texas at Austin.
25. Kouvelis, P., G. Yu,. 1997. Robust Discrete Optimization and its Applications, Kluwer Academic Publishers, Boston.
26. Kouvelis, P., and, P. Su,. 2007. The Structure of Global Supply Chains, Now Publishers, Boston.
27. Kreipl S., M. Pinedo,. 2004. Planning and scheduling in supply chains: An overview of issues in practice. Prod. Oper. Manag. 13 (1): 77-92.
28. Magnanti, T. L., P. Mireault, and, R. T. Wong,. 1986. Tailoring Benders decomposition for uncapacitated network design. Math. Program. Study 26: 112-154.
29. Melo, M. T., S. Nickel, F. Saldanha-da-Gama,. 2009. Facility location and supply chain management-A review. Eur. J. Oper. Res. 196: 401-412.
30. MirHassani, S. A., C. Lucas, G. Mitra, E. Messina, and, C. A. Poojari,. 2000. Computational solution of capacity planning models under uncertainty. Parallel Comput. 26: 511-538.
31. Owen, S. H., M. S. Daskin,. 1998. Strategic facility location: A review. Eur. J. Oper. Res. 111: 423-447.
32. Pan, F., R. Nagi,. 2010. Robust supply chain design under uncertain demand in agile manufacturing. Comput. Oper. Res. 37: 668-683
33. Poojari, C. A., C. Lucas, G. Mitra,. 2008. Robust solutions and risk measures for a supply chain planning problem under uncertainty. J. Oper. Res. Soc. 59 (1): 2-12.
34. Rafael A., L. Abdel, M. Nelson, P. Gérard,. 2006. Enhancing a branch-and-bound algorithm for two-Stage stochastic integer network design-based models. Manage. Sci. 52 (9): 1450-1455.
35. Ravi, R., A. Sinha,. 2006. Approximation algorithms for problems combining facility location and network design. Oper. Res. 54 (1): 73-81.
36. Sahin, G., H. Süral,. 2007. A review of hierarchical facility location models. Comput. Oper. Res. 34: 2310-2331.
37. Santoso, T., S. Ahmed, M. Goetschalckx, and, A. Shapiro,. 2005. A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167: 96-115.
38. Shen, Z. J., 2007. Integrated supply chain design models: A survey and future research directions. J. Ind. Manage. Optimiz. 3 (1): 1-27.
39. Shetty C. M., 1963. A simplified procedure for quadratic programming. Oper. Res. 11: 248-260.
40. Snyder, L. V., 2006. Facility location under uncertainty: a review. IIE Trans. 38: 537-554.
41. Snyder, L. V., M. S. Daskin,. 2006. Stochastic p-robust location problems. IIE Trans. 38 (11): 971-985.
42. Tsiakis, P., N. Shah, C. C. Pantelides,. 2001. Design of multi-echelon supply chain networks under demand uncertainty. Indus. Eng. Chem. Res. 40: 3585-3604.
43. Wolfe, P., 1959. The simplex method for quadratic programming. Econometrica 27 (3): 382-398.