메뉴 건너뛰기




Volumn 43, Issue 4, 2009, Pages 455-472

Facility location modeling and inventory management with multisourcing

Author keywords

Lagrangian relaxation; Nonlinear transportation problem; Supply chain network design

Indexed keywords

COSTS; INTEGER PROGRAMMING; INVENTORY CONTROL; LAGRANGE MULTIPLIERS; LOCATION; LOGISTICS; SALES; SENSITIVITY ANALYSIS; SUPPLY CHAINS; TRANSPORTATION; WAREHOUSES;

EID: 73349086220     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1090.0268     Document Type: Article
Times cited : (77)

References (26)
  • 1
    • 0017454118 scopus 로고
    • An efficient branch and bound algorithm for the capacitated warehouse location problem
    • Akinc, U., B. M. Khumawala. 1977. An efficient branch and bound algorithm for the capacitated warehouse location problem. Management Sci. 23 585-594.
    • (1977) Management Sci , vol.23 , pp. 585-594
    • Akinc, U.1    Khumawala, B.M.2
  • 3
    • 32144445293 scopus 로고    scopus 로고
    • Location of congested capacitated facilities with distance-sensitive demand
    • Berman, O., Z. Drezner. 2006. Location of congested capacitated facilities with distance-sensitive demand. Inst. Indust. Engineers (IIE) Transactions. 38(3) 213-221.
    • (2006) Inst. Indust. Engineers (IIE) Transactions , vol.38 , Issue.3 , pp. 213-221
    • Berman, O.1    Drezner, Z.2
  • 6
    • 84988183295 scopus 로고
    • A new approach to solving applied location/allocation problems
    • Daskin, M. S., P. C. Jones. 1993. A new approach to solving applied location/allocation problems. Microcomputers Civil Engrg. 8 409-421.
    • (1993) Microcomputers Civil Engrg , vol.8 , pp. 409-421
    • Daskin, M.S.1    Jones, P.C.2
  • 7
    • 0036033283 scopus 로고    scopus 로고
    • An inventory-location model: Formulation, solution algorithm and computational results
    • Daskin, M. S., C. R. Coullard, Z.-J. M. Shen. 2002. An inventory-location model: Formulation, solution algorithm and computational results. Ann. Oper. Res. 110 83-106.
    • (2002) Ann. Oper. Res , vol.110 , pp. 83-106
    • Daskin, M.S.1    Coullard, C.R.2    Shen, Z.-J.M.3
  • 8
    • 12344266783 scopus 로고    scopus 로고
    • Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
    • Eskigun, E., R. Uzsoy, P. V. Preckel, G. Beaujon, S. Krishnan, J. D. Tew. 2005. Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers. Eur. J. Oper. Res. 165 182-206.
    • (2005) Eur. J. Oper. Res , vol.165 , pp. 182-206
    • Eskigun, E.1    Uzsoy, R.2    Preckel, P.V.3    Beaujon, G.4    Krishnan, S.5    Tew, J.D.6
  • 9
    • 0019477279 scopus 로고
    • The Lagrangian relaxation method for solving integer programming problems
    • Fisher, M. L. 1981. The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27(1) 1-18.
    • (1981) Management Sci , vol.27 , Issue.1 , pp. 1-18
    • Fisher, M.L.1
  • 10
    • 0022031091 scopus 로고
    • An applications-oriented guide to Lagrangian relaxation
    • Fisher, M. L. 1985. An applications-oriented guide to Lagrangian relaxation. Interfaces 15(2) 10-21.
    • (1985) Interfaces , vol.15 , Issue.2 , pp. 10-21
    • Fisher, M.L.1
  • 11
    • 0017942883 scopus 로고
    • Lagrangian relaxation applied to capacitated facility location problem
    • Geoffrion, M., R. McBride. 1978. Lagrangian relaxation applied to capacitated facility location problem. AIIE Trans. 10 40-47.
    • (1978) AIIE Trans , vol.10 , pp. 40-47
    • Geoffrion, M.1    McBride, R.2
  • 12
    • 0018521802 scopus 로고
    • A direct dual method for the mixed plant location problem
    • Guignard, M., K. Spielberg. 1979. A direct dual method for the mixed plant location problem. Math. Programming 17 198-228.
    • (1979) Math. Programming , vol.17 , pp. 198-228
    • Guignard, M.1    Spielberg, K.2
  • 13
    • 0022711337 scopus 로고
    • A Lagrangian relaxation heuristic for capacitated facility location with single-sourcing constraints
    • Klincewicz, J. G., H. Luss. 1986. A Lagrangian relaxation heuristic for capacitated facility location with single-sourcing constraints. J. Oper. Res. Soc. 37 495-500.
    • (1986) J. Oper. Res. Soc , vol.37 , pp. 495-500
    • Klincewicz, J.G.1    Luss, H.2
  • 14
    • 0002106049 scopus 로고
    • The simple plant location problem- survey and synthesis
    • Krarup, J., P. M. Pruzan. 1983. The simple plant location problem- survey and synthesis. Eur. J. Oper. Res. 2 36-81.
    • (1983) Eur. J. Oper. Res , vol.2 , pp. 36-81
    • Krarup, J.1    Pruzan, P.M.2
  • 15
    • 73349124859 scopus 로고    scopus 로고
    • Supply chain network design with dynamic sourcing
    • Submitted
    • Mak, H., Z.-J. M. Shen. 2009. Supply chain network design with dynamic sourcing. Submitted, Transportation Sci.
    • (2009) Transportation Sci
    • Mak, H.1    Shen, Z.-J.M.2
  • 17
    • 0018056041 scopus 로고
    • An improved algorithm for the capacitated facility location problem
    • Nauss, R. M. 1978. An improved algorithm for the capacitated facility location problem. Oper. Res. Soc. 29 1195-1202.
    • (1978) Oper. Res. Soc , vol.29 , pp. 1195-1202
    • Nauss, R.M.1
  • 19
    • 43949140914 scopus 로고    scopus 로고
    • Capacitated warehouse location model with risk-pooling
    • Forthcoming
    • Ozsen, L., C. R. Coullard, M. S. Daskin. 2008. Capacitated warehouse location model with risk-pooling. Naval Res. Logist. Forthcoming.
    • (2008) Naval Res. Logist
    • Ozsen, L.1    Coullard, C.R.2    Daskin, M.S.3
  • 20
    • 0023246782 scopus 로고
    • Efficient algorithms for the capacitated concentrator location problems
    • Pirkul, H. 1987. Efficient algorithms for the capacitated concentrator location problems. Comput. Oper. Res. 14(3) 197-208.
    • (1987) Comput. Oper. Res , vol.14 , Issue.3 , pp. 197-208
    • Pirkul, H.1
  • 21
    • 0032188469 scopus 로고    scopus 로고
    • A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution
    • Pirkul, H., J. Vaidyanathan. 1998. A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. Comput. Oper. Res. 25 869-878.
    • (1998) Comput. Oper. Res , vol.25 , pp. 869-878
    • Pirkul, H.1    Vaidyanathan, J.2
  • 23
    • 22944440358 scopus 로고    scopus 로고
    • A multi-commodity supply chain design problem
    • Shen, Z.-J. M. 2005. A multi-commodity supply chain design problem. IIE Trans. 37 753-762.
    • (2005) IIE Trans , vol.37 , pp. 753-762
    • Shen, Z.-J.M.1
  • 26
    • 0036421121 scopus 로고    scopus 로고
    • Algorithms for a facility location problem with stochastic customer demand and immobile servers
    • Wang, Q., R. Batta, C. M. Rump. 2002. Algorithms for a facility location problem with stochastic customer demand and immobile servers. Ann. Oper. Res. 111 17-34.
    • (2002) Ann. Oper. Res , vol.111 , pp. 17-34
    • Wang, Q.1    Batta, R.2    Rump, C.M.3


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