메뉴 건너뛰기




Volumn 37, Issue , 2015, Pages 255-276

Robust and fuzzy goal programming optimization approaches for a novel multi-objective hub location-allocation problem: A supply chain overview

Author keywords

Fuzzy goal programming; Multi objective hub location; Supply chain network

Indexed keywords

COMPUTER PROGRAMMING; FUNCTIONS; GAS PLANTS; GREENHOUSE GASES; LINEAR PROGRAMMING; LOCATION; MATERIALS HANDLING; PROBLEM SOLVING; SUPPLY CHAINS; UNCERTAINTY ANALYSIS;

EID: 84940910178     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2015.07.038     Document Type: Article
Times cited : (58)

References (63)
  • 1
    • 0242470365 scopus 로고    scopus 로고
    • On the location of hub facilities
    • T. Aykin On the location of hub facilities Transp. Sci. 22 2 1998 155 157
    • (1998) Transp. Sci. , vol.22 , Issue.2 , pp. 155-157
    • Aykin, T.1
  • 2
    • 0029352467 scopus 로고
    • Networking policies for hub-and-spoke systems with application to the air transportation system
    • T. Aykin Networking policies for hub-and-spoke systems with application to the air transportation system Transp. Sci. 29 3 1995 201 221
    • (1995) Transp. Sci. , vol.29 , Issue.3 , pp. 201-221
    • Aykin, T.1
  • 3
    • 0000115883 scopus 로고
    • The hub location and routing problem
    • T. Aykin The hub location and routing problem Eur. J. Oper. Res. 83 1995 200 219
    • (1995) Eur. J. Oper. Res. , vol.83 , pp. 200-219
    • Aykin, T.1
  • 4
    • 0026904158 scopus 로고
    • Interacting new facilities and location-allocation problem
    • T. Aykin, and G.F. Brown Interacting new facilities and location-allocation problem Transp. Sci. 26 3 1992 212 222
    • (1992) Transp. Sci. , vol.26 , Issue.3 , pp. 212-222
    • Aykin, T.1    Brown, G.F.2
  • 5
    • 0025436512 scopus 로고
    • Locating transportation terminals to serve an expanding demand
    • J.F. Campbell Locating transportation terminals to serve an expanding demand Transp. Res. B 24B 3 1990 173 192
    • (1990) Transp. Res. B , vol.24 B , Issue.3 , pp. 173-192
    • Campbell, J.F.1
  • 6
    • 0022721842 scopus 로고
    • The location of interacting hub facilities
    • M.E. O'Kelly The location of interacting hub facilities Transp. Sci. 20 2 1986 92 105
    • (1986) Transp. Sci. , vol.20 , Issue.2 , pp. 92-105
    • O'Kelly, M.E.1
  • 7
    • 0022908535 scopus 로고
    • Activity levels at hub facilities in interacting networks
    • M.E. O'Kelly Activity levels at hub facilities in interacting networks Geogr. Anal. 18 4 1986 343 356
    • (1986) Geogr. Anal. , vol.18 , Issue.4 , pp. 343-356
    • O'Kelly, M.E.1
  • 8
    • 84881016647 scopus 로고    scopus 로고
    • Hub network design with single and multiple allocation: A computational study
    • M.E. O'Kelly, D. Bryan, D. Skorin-Kapov, and J. Skorin-Kapov Hub network design with single and multiple allocation: a computational study Locat. Sci. 4 3 1996 125 138
    • (1996) Locat. Sci. , vol.4 , Issue.3 , pp. 125-138
    • O'Kelly, M.E.1    Bryan, D.2    Skorin-Kapov, D.3    Skorin-Kapov, J.4
  • 9
    • 0026379355 scopus 로고
    • Solution strategies for the single facility minimax hub location problem
    • M.E. O'Kelly, and H.J. Miller Solution strategies for the single facility minimax hub location problem Pap. Reg. Sci. 70 4 1991 367 380
    • (1991) Pap. Reg. Sci. , vol.70 , Issue.4 , pp. 367-380
    • O'Kelly, M.E.1    Miller, H.J.2
  • 10
    • 35649000310 scopus 로고    scopus 로고
    • An interactive possibilistic programming approach for multiple objective supply chain master planning
    • S.A. Torabi, and E. Hassini An interactive possibilistic programming approach for multiple objective supply chain master planning Fuzzy Sets Syst. 159 2008 193 214
    • (2008) Fuzzy Sets Syst. , vol.159 , pp. 193-214
    • Torabi, S.A.1    Hassini, E.2
  • 11
    • 0028259333 scopus 로고
    • Integer programming formulations of discrete hub location problems
    • J.F. Campbell Integer programming formulations of discrete hub location problems Eur. J. Oper. Res. 72 1994 387 405
    • (1994) Eur. J. Oper. Res. , vol.72 , pp. 387-405
    • Campbell, J.F.1
  • 12
    • 0030575685 scopus 로고    scopus 로고
    • Tight linear programming relaxations of uncapacitated p-hub median problems
    • D. Skorin-Kapov, J. Skorin-Kapov, and M. O'Kelly Tight linear programming relaxations of uncapacitated p-hub median problems Eur. J. Oper. Res. 94 1996 582 593
    • (1996) Eur. J. Oper. Res. , vol.94 , pp. 582-593
    • Skorin-Kapov, D.1    Skorin-Kapov, J.2    O'Kelly, M.3
  • 13
    • 0040913897 scopus 로고    scopus 로고
    • Efficient algorithms for the uncapacitated single allocation p-hub median problem
    • A.T. Ernst, and M. Krishnamoorthy Efficient algorithms for the uncapacitated single allocation p-hub median problem Locat. Sci. 4 3 1996 139 154
    • (1996) Locat. Sci. , vol.4 , Issue.3 , pp. 139-154
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 14
    • 0032122903 scopus 로고    scopus 로고
    • Efficient solution procedure and reduced size formulations for p-hub location problems
    • J. Sohn, and S. Park Efficient solution procedure and reduced size formulations for p-hub location problems Eur. J. Oper. Res. 108 1998 118 126
    • (1998) Eur. J. Oper. Res. , vol.108 , pp. 118-126
    • Sohn, J.1    Park, S.2
  • 15
    • 84898678973 scopus 로고    scopus 로고
    • Reliable p-median facility location problem: Two-stage robust models and algorithms
    • Y. An, B. Zeng, Y. Zhang, and L. Zhao Reliable p-median facility location problem: two-stage robust models and algorithms Transp. Res. B: Methodol. 64 2014 54 72
    • (2014) Transp. Res. B: Methodol. , vol.64 , pp. 54-72
    • An, Y.1    Zeng, B.2    Zhang, Y.3    Zhao, L.4
  • 16
    • 84857030832 scopus 로고    scopus 로고
    • The capacitated p-hub median problem with integral constraints: An application to a Chinese air cargo network
    • C.C. Lin, J.Y. Lin, and Y.C. Chen The capacitated p-hub median problem with integral constraints: an application to a Chinese air cargo network Appl. Math. Model. 36 6 2012 2777 2787
    • (2012) Appl. Math. Model. , vol.36 , Issue.6 , pp. 2777-2787
    • Lin, C.C.1    Lin, J.Y.2    Chen, Y.C.3
  • 17
    • 84884629344 scopus 로고    scopus 로고
    • GRASP for the uncapacitated r-allocation p-hub median problem
    • J. Peiró, A. Corberán, and R. Martí GRASP for the uncapacitated r-allocation p-hub median problem Comput. Oper. Res. 43 2014 50 60
    • (2014) Comput. Oper. Res. , vol.43 , pp. 50-60
    • Peiró, J.1    Corberán, A.2    Martí, R.3
  • 18
    • 84884290696 scopus 로고    scopus 로고
    • A specialized branch & bound & cut for single-allocation ordered median hub location problems
    • J. Puerto, A.B. Ramos, and A.M. Rodríguez-Chía A specialized branch & bound & cut for single-allocation ordered median hub location problems Discret. Appl. Math. 161 16-17 2013 2624 2646
    • (2013) Discret. Appl. Math. , vol.161 , Issue.16-17 , pp. 2624-2646
    • Puerto, J.1    Ramos, A.B.2    Rodríguez-Chía, A.M.3
  • 19
    • 0034273546 scopus 로고    scopus 로고
    • On the single-assignment p-hub center problem
    • B.Y. Kara, and B.C. Tansel On the single-assignment p-hub center problem Eur. J. Oper. Res. 125 2000 648 655
    • (2000) Eur. J. Oper. Res. , vol.125 , pp. 648-655
    • Kara, B.Y.1    Tansel, B.C.2
  • 22
    • 67349187596 scopus 로고    scopus 로고
    • Working paper Department of Mathematics, University of Kaiserslautern Kaiserslautern, Germany
    • H.W. Hamacher, and T. Meyer Hub cover and hub center problems Working paper 2006 Department of Mathematics, University of Kaiserslautern Kaiserslautern, Germany
    • (2006) Hub Cover and Hub Center Problems
    • Hamacher, H.W.1    Meyer, T.2
  • 23
    • 84872154511 scopus 로고    scopus 로고
    • The hardness and approximation of the star p-hub center problem
    • H. Liang The hardness and approximation of the star p-hub center problem Oper. Res. Lett. 41 2 2013 138 141
    • (2013) Oper. Res. Lett. , vol.41 , Issue.2 , pp. 138-141
    • Liang, H.1
  • 24
    • 84859713541 scopus 로고    scopus 로고
    • Star p-hub center problem and star p-hub median problem with bounded path lengths
    • H. Yaman, and S. Elloumi Star p-hub center problem and star p-hub median problem with bounded path lengths Comput. Oper. Res. 39 11 2012 2725 2732
    • (2012) Comput. Oper. Res. , vol.39 , Issue.11 , pp. 2725-2732
    • Yaman, H.1    Elloumi, S.2
  • 25
    • 84869102652 scopus 로고    scopus 로고
    • An improved hybrid particle swarm optimization algorithm for fuzzy p-hub center problem
    • K. Yang, Y. Liu, and G. Yang An improved hybrid particle swarm optimization algorithm for fuzzy p-hub center problem Comput. Ind. Eng. 64 1 2013 133 142
    • (2013) Comput. Ind. Eng. , vol.64 , Issue.1 , pp. 133-142
    • Yang, K.1    Liu, Y.2    Yang, G.3
  • 26
    • 84904797307 scopus 로고    scopus 로고
    • Optimizing fuzzy p-hub center problem with generalized value-at-risk criterion
    • K. Yang, Y. Liu, and G. Yang Optimizing fuzzy p-hub center problem with generalized value-at-risk criterion Appl. Math. Model. 38 2014 3987 4005
    • (2014) Appl. Math. Model. , vol.38 , pp. 3987-4005
    • Yang, K.1    Liu, Y.2    Yang, G.3
  • 27
    • 0037284598 scopus 로고    scopus 로고
    • The single-assignment hub covering problem: Models and linearizations
    • B.Y. Kara, and B.C. Tansel The single-assignment hub covering problem: models and linearizations J. Oper. Res. Soc. 54 2003 59 64
    • (2003) J. Oper. Res. Soc. , vol.54 , pp. 59-64
    • Kara, B.Y.1    Tansel, B.C.2
  • 29
    • 84888341773 scopus 로고    scopus 로고
    • The incomplete hub-covering location problem considering imprecise location of demands
    • S. Davari, M.H. Fazel Zarandi, and I.B. Turksen The incomplete hub-covering location problem considering imprecise location of demands Sci. Iran. 20 3 2013 983 991
    • (2013) Sci. Iran. , vol.20 , Issue.3 , pp. 983-991
    • Davari, S.1    Fazel Zarandi, M.H.2    Turksen, I.B.3
  • 30
    • 84860998123 scopus 로고    scopus 로고
    • Uncapacitated single allocation p-hub maximal covering problem
    • Y.H. Hwang, and Y.H. Lee Uncapacitated single allocation p-hub maximal covering problem Comput. Ind. Eng. 63 2 2012 382 389
    • (2012) Comput. Ind. Eng. , vol.63 , Issue.2 , pp. 382-389
    • Hwang, Y.H.1    Lee, Y.H.2
  • 31
    • 84855885952 scopus 로고    scopus 로고
    • Hub covering location problems with different coverage types
    • H. Karimi, and M. Bashiri Hub covering location problems with different coverage types Sci. Iran. 18 6 2011 1571 1578
    • (2011) Sci. Iran. , vol.18 , Issue.6 , pp. 1571-1578
    • Karimi, H.1    Bashiri, M.2
  • 32
    • 80052645057 scopus 로고    scopus 로고
    • An M/M/c queue model for hub covering location problem
    • M. Mohammadi, F. Jolai, and H. Rostami An M/M/c queue model for hub covering location problem Math. Comput. Model. 54 11-12 2011 2623 2638
    • (2011) Math. Comput. Model. , vol.54 , Issue.11-12 , pp. 2623-2638
    • Mohammadi, M.1    Jolai, F.2    Rostami, H.3
  • 33
    • 0028681894 scopus 로고
    • Lagrangean relaxation based approaches to capacitated hub-and-spoke network design problem
    • T. Aykin Lagrangean relaxation based approaches to capacitated hub-and-spoke network design problem Eur. J. Oper. Res. 79 3 1994 501 523
    • (1994) Eur. J. Oper. Res. , vol.79 , Issue.3 , pp. 501-523
    • Aykin, T.1
  • 35
    • 0043096486 scopus 로고    scopus 로고
    • Solution algorithms for the capacitated single allocation hub location problem
    • A.T. Ernst, and M. Krishnamoorthy Solution algorithms for the capacitated single allocation hub location problem Ann. Oper. Res. 86 1999 141 159
    • (1999) Ann. Oper. Res. , vol.86 , pp. 141-159
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 36
    • 4444277652 scopus 로고    scopus 로고
    • Projecting flow variables for hub location problems
    • M. Labbe, and H. Yaman Projecting flow variables for hub location problems Networks 44 2 2004 84 93
    • (2004) Networks , vol.44 , Issue.2 , pp. 84-93
    • Labbe, M.1    Yaman, H.2
  • 37
    • 27844545418 scopus 로고    scopus 로고
    • Uncapacitated Euclidean hub location: Strengthened formulation, new facets and a relax-and-cut algorithm
    • A. Marin Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm J. Glob. Optim. 33 2005 393 422
    • (2005) J. Glob. Optim. , vol.33 , pp. 393-422
    • Marin, A.1
  • 38
    • 32544439876 scopus 로고    scopus 로고
    • New formulations for the uncapacitated multiple allocation hub location problem
    • A. Marin, L. Canovas, and M. Landete New formulations for the uncapacitated multiple allocation hub location problem Eur. J. Oper. Res. 172 1 2006 274 292
    • (2006) Eur. J. Oper. Res. , vol.172 , Issue.1 , pp. 274-292
    • Marin, A.1    Canovas, L.2    Landete, M.3
  • 39
    • 84894904496 scopus 로고    scopus 로고
    • Proprietor and customer costs in the incomplete hub location-routing network topology
    • H. Karimi, and M. Setak Proprietor and customer costs in the incomplete hub location-routing network topology Appl. Math. Model. 38 3 2014 1011 1023
    • (2014) Appl. Math. Model. , vol.38 , Issue.3 , pp. 1011-1023
    • Karimi, H.1    Setak, M.2
  • 40
    • 4444366224 scopus 로고    scopus 로고
    • A cost allocation problem arising in hub-spoke network systems
    • N. Matsubayashi, M. Umezawa, Y. Masuda, and H. Nishino A cost allocation problem arising in hub-spoke network systems Eur. J. Oper. Res. 160 3 2005 821 838
    • (2005) Eur. J. Oper. Res. , vol.160 , Issue.3 , pp. 821-838
    • Matsubayashi, N.1    Umezawa, M.2    Masuda, Y.3    Nishino, H.4
  • 42
    • 41349092784 scopus 로고    scopus 로고
    • Capacitated single allocation hub location problem - A bi-criteria approach
    • M.G. Costa, M.E. Captivo, and J. Climaco Capacitated single allocation hub location problem - a bi-criteria approach Comput. Oper. Res. 35 2008 3671 3695
    • (2008) Comput. Oper. Res. , vol.35 , pp. 3671-3695
    • Costa, M.G.1    Captivo, M.E.2    Climaco, J.3
  • 43
    • 70349613640 scopus 로고    scopus 로고
    • A two-leveled multi-objective symbiotic evolutionary algorithm for the hub and spoke location problem
    • K.S. Shin, J.H. Kim, and Y.K. Kim A two-leveled multi-objective symbiotic evolutionary algorithm for the hub and spoke location problem J. Adv. Transp. 43 4 2009 391 411
    • (2009) J. Adv. Transp. , vol.43 , Issue.4 , pp. 391-411
    • Shin, K.S.1    Kim, J.H.2    Kim, Y.K.3
  • 44
    • 67649535163 scopus 로고    scopus 로고
    • Robust optimization of hub-and-spoke airline network design based on multi-objective genetic algorithm
    • J. Huang, and Q. Wang Robust optimization of hub-and-spoke airline network design based on multi-objective genetic algorithm J. Transp. Syst. Eng. Inf. Technol. 9 3 2009 86 92
    • (2009) J. Transp. Syst. Eng. Inf. Technol. , vol.9 , Issue.3 , pp. 86-92
    • Huang, J.1    Wang, Q.2
  • 45
    • 72449132015 scopus 로고    scopus 로고
    • Location of road passenger transportation hub based on multi-objective optimization
    • H.R. Hao, C.F. Shao, H. Yue, and L.M. Duan Location of road passenger transportation hub based on multi-objective optimization J. Transp. Syst. Eng. Inf. Technol. 9 5 2009 90 95
    • (2009) J. Transp. Syst. Eng. Inf. Technol. , vol.9 , Issue.5 , pp. 90-95
    • Hao, H.R.1    Shao, C.F.2    Yue, H.3    Duan, L.M.4
  • 47
    • 78649340826 scopus 로고    scopus 로고
    • Bicriteria p-hub location problems and evolutionary algorithms
    • M. Köksalan, and B. Soylu Bicriteria p-hub location problems and evolutionary algorithms INFORMS J. Comput. 22 4 2010 528 542
    • (2010) INFORMS J. Comput. , vol.22 , Issue.4 , pp. 528-542
    • Köksalan, M.1    Soylu, B.2
  • 48
    • 84868690724 scopus 로고    scopus 로고
    • A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem
    • M. Mohammadi, R. Tavakkoli-Moghaddam, and H. Rostami A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem Int. J. Ind. Eng. Comput. 2 3 2011 671 688
    • (2011) Int. J. Ind. Eng. Comput. , vol.2 , Issue.3 , pp. 671-688
    • Mohammadi, M.1    Tavakkoli-Moghaddam, R.2    Rostami, H.3
  • 49
    • 84887410988 scopus 로고    scopus 로고
    • Solving a new stochastic multi-mode p-hub covering location problem considering risk by a novel multi-objective algorithm
    • M. Mohammadi, F. Jolai, and R. Tavakkoli-Moghaddam Solving a new stochastic multi-mode p-hub covering location problem considering risk by a novel multi-objective algorithm Appl. Math. Model. 37 24 2013 10053 10073
    • (2013) Appl. Math. Model. , vol.37 , Issue.24 , pp. 10053-10073
    • Mohammadi, M.1    Jolai, F.2    Tavakkoli-Moghaddam, R.3
  • 51
    • 84897442872 scopus 로고    scopus 로고
    • An Improved decomposition-based memetic algorithm for multi-objective capacitated arc routing problem
    • R. Shang, J. Wan, L. Jiao, and Y. Wang An Improved decomposition-based memetic algorithm for multi-objective capacitated arc routing problem Appl. Soft Comput. 19 2014 343 361
    • (2014) Appl. Soft Comput. , vol.19 , pp. 343-361
    • Shang, R.1    Wan, J.2    Jiao, L.3    Wang, Y.4
  • 52
    • 84882916396 scopus 로고    scopus 로고
    • A two-period game of a closed-loop supply chain
    • P. De Giovanni, and G. Zaccour A two-period game of a closed-loop supply chain Eur. J. Oper. Res. 232 1 2014 22 40
    • (2014) Eur. J. Oper. Res. , vol.232 , Issue.1 , pp. 22-40
    • De Giovanni, P.1    Zaccour, G.2
  • 53
    • 84901197729 scopus 로고    scopus 로고
    • Hybrid algorithm for a vendor managed inventory system in a two-echelon supply chain
    • A. Diabat Hybrid algorithm for a vendor managed inventory system in a two-echelon supply chain Eur. J. Oper. Res. 238 1 2014 114 121
    • (2014) Eur. J. Oper. Res. , vol.238 , Issue.1 , pp. 114-121
    • Diabat, A.1
  • 54
    • 84897988804 scopus 로고    scopus 로고
    • Joint production and delivery lot sizing for a make-to-order producer-buyer supply chain with transportation cost
    • S.D. Lee, and Y.C. Fu Joint production and delivery lot sizing for a make-to-order producer-buyer supply chain with transportation cost Transp. Res. E: Logist. Transp. Rev. 66 2014 23 25
    • (2014) Transp. Res. E: Logist. Transp. Rev. , vol.66 , pp. 23-25
    • Lee, S.D.1    Fu, Y.C.2
  • 56
    • 84896938076 scopus 로고    scopus 로고
    • A supply chain network design model for biomass co-firing in coal-fired power plants
    • M.S. Roni, S.D. Eksioglu, E. Searcy, and K. Jha A supply chain network design model for biomass co-firing in coal-fired power plants Transp. Res. E: Logist. Transp. Rev. 61 2014 115 134
    • (2014) Transp. Res. E: Logist. Transp. Rev. , vol.61 , pp. 115-134
    • Roni, M.S.1    Eksioglu, S.D.2    Searcy, E.3    Jha, K.4
  • 58
    • 77956182227 scopus 로고    scopus 로고
    • A robust optimization approach to closed-loop supply chain network design under uncertainty
    • M.S. Pishvaee, M. Rabbani, and S.A. Torabi A robust optimization approach to closed-loop supply chain network design under uncertainty Appl. Math. Model. 35 2011 637 649
    • (2011) Appl. Math. Model. , vol.35 , pp. 637-649
    • Pishvaee, M.S.1    Rabbani, M.2    Torabi, S.A.3
  • 59
    • 84862982845 scopus 로고    scopus 로고
    • Reliable design of a forward/reverse logistics network under uncertainty: A robust-M/M/c queuing model
    • B. Vahdani, R. Tavakkoli-Moghaddam, M. Modarres, and A. Baboli Reliable design of a forward/reverse logistics network under uncertainty: a robust-M/M/c queuing model Transp. Res. E 48 2012 1152 1168
    • (2012) Transp. Res. e , vol.48 , pp. 1152-1168
    • Vahdani, B.1    Tavakkoli-Moghaddam, R.2    Modarres, M.3    Baboli, A.4
  • 60
    • 25444444535 scopus 로고    scopus 로고
    • Retailer supplier flexible commitments contracts - A robust optimization approach
    • A. Ben-Tal, B. Golany, A. Nemirovsky, and J.P. Vial Retailer supplier flexible commitments contracts - a robust optimization approach Manuf. Serv. Oper. Manage. 7 2005 248 271
    • (2005) Manuf. Serv. Oper. Manage. , vol.7 , pp. 248-271
    • Ben-Tal, A.1    Golany, B.2    Nemirovsky, A.3    Vial, J.P.4
  • 61
    • 0032664938 scopus 로고    scopus 로고
    • Robust solutions of uncertain linear programs
    • A. Ben-Tal, and A. Nemirovsky Robust solutions of uncertain linear programs Oper. Res. Lett. 25 1 1999 1 13
    • (1999) Oper. Res. Lett. , vol.25 , Issue.1 , pp. 1-13
    • Ben-Tal, A.1    Nemirovsky, A.2
  • 62
    • 77955681026 scopus 로고    scopus 로고
    • A possibilistic programming approach for closed-loop supply chain network design under uncertainty
    • M.S. Pishvaee, and S.A. Torabi A possibilistic programming approach for closed-loop supply chain network design under uncertainty Fuzzy Sets Syst. 161 20 2010 2668 2683
    • (2010) Fuzzy Sets Syst. , vol.161 , Issue.20 , pp. 2668-2683
    • Pishvaee, M.S.1    Torabi, S.A.2
  • 63
    • 33750455436 scopus 로고    scopus 로고
    • A possibilistic decision model for new product supply chain design
    • J. Wang, and Y.F. Shu A possibilistic decision model for new product supply chain design Eur. J. Oper. Res. 177 2007 1044 1061
    • (2007) Eur. J. Oper. Res. , vol.177 , pp. 1044-1061
    • Wang, J.1    Shu, Y.F.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.