메뉴 건너뛰기




Volumn 30, Issue 4, 1996, Pages 291-302

Production, transportation, and distribution planning in a multi-commodity tri-echelon system

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; HEURISTIC METHODS; MANUFACTURE; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PRODUCTIVITY; WAREHOUSES;

EID: 0030287750     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.30.4.291     Document Type: Article
Times cited : (132)

References (24)
  • 1
    • 0021374179 scopus 로고
    • A Heuristic Lagrangian Algorithm for the Capacitated Plant Location Problem
    • J. BARCELO, AND J. CASANOVAS, "A Heuristic Lagrangian Algorithm for the Capacitated Plant Location Problem," European Journal of Operational Research 15, 212-226 (1984).
    • (1984) European Journal of Operational Research , vol.15 , pp. 212-226
    • Barcelo, J.1    Casanovas, J.2
  • 2
    • 0023963030 scopus 로고
    • An Algorithm for Solving Large Capacitated Warehouse Location Problems
    • J. E. BEASLEY, "An Algorithm for Solving Large Capacitated Warehouse Location Problems." European Journal of Operational Research 33, 314-325 (1988).
    • (1988) European Journal of Operational Research , vol.33 , pp. 314-325
    • Beasley, J.E.1
  • 4
    • 0041908677 scopus 로고
    • Site Location Via Mixed-Integer Programming
    • D. G. ELSON, "Site Location Via Mixed-Integer Programming," Operational Research Quarterly 23, 31-43 (1972).
    • (1972) Operational Research Quarterly , vol.23 , pp. 31-43
    • Elson, D.G.1
  • 5
    • 0000703172 scopus 로고
    • Generalized Lagrangian Multipliers Method for Solving Problems of Optimal Allocation of Resources
    • H. EVERETT, "Generalized Lagrangian Multipliers Method for Solving Problems of Optimal Allocation of Resources," Operations Research 11, 399-417 (1963).
    • (1963) Operations Research , vol.11 , pp. 399-417
    • Everett, H.1
  • 6
    • 0019477279 scopus 로고
    • The Lagrangian Relaxation Method for Solving Integer Programming Problems
    • M. FISHER, "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science 27, 1-18 (1981).
    • (1981) Management Science , vol.27 , pp. 1-18
    • Fisher, M.1
  • 8
    • 0017911225 scopus 로고
    • On Obtaining the 'Best' Multipliers for a Lagrangian Relaxation for Integer Programming
    • B. GAVISH, "On Obtaining the 'Best' Multipliers for a Lagrangian Relaxation for Integer Programming," Computers and Operations Research 5, 55-71 (1978).
    • (1978) Computers and Operations Research , vol.5 , pp. 55-71
    • Gavish, B.1
  • 9
    • 0022752119 scopus 로고
    • Computer and Database Location in Distributed Computer Systems
    • B. GAVISH, AND H. PIRKUL, "Computer and Database Location in Distributed Computer Systems," IEEE Transactions on Computers 35, 583-590 (1986).
    • (1986) IEEE Transactions on Computers , vol.35 , pp. 583-590
    • Gavish, B.1    Pirkul, H.2
  • 10
    • 0015973449 scopus 로고
    • Multicommodity Distribution System Design by Benders Decomposition
    • A. GEOFFRION AND G. W. GRAVES, "Multicommodity Distribution System Design by Benders Decomposition," Management Science 20, 822-844 (1974).
    • (1974) Management Science , vol.20 , pp. 822-844
    • Geoffrion, A.1    Graves, G.W.2
  • 11
    • 0018521802 scopus 로고
    • A Direct Dual Method for the Mixed Plant Location Problem
    • M. GUIGNARD AND K SPIELBERG, "A Direct Dual Method for the Mixed Plant Location Problem," Mathematical Programming 17/2, 198-228 (1979).
    • (1979) Mathematical Programming , vol.2-17 , pp. 198-228
    • Guignard, M.1    Spielberg, K.2
  • 14
    • 0022711337 scopus 로고
    • A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
    • J. KLINCEWICZ AND H. Luss, "A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints," Journal of Operational Research Society 37, 495-500 (1986).
    • (1986) Journal of Operational Research Society , vol.37 , pp. 495-500
    • Klincewicz, J.1    Luss, H.2
  • 16
    • 0027606342 scopus 로고
    • A Cross Decomposition Algorithm for a Multi-product-Multitype Facility Location Problem
    • C. Y. LEE, "A Cross Decomposition Algorithm for a Multi-product-Multitype Facility Location Problem," Computers and Operations Research 20/5, 527-540 (1993).
    • (1993) Computers and Operations Research , vol.5-20 , pp. 527-540
    • Lee, C.Y.1
  • 17
    • 0023246782 scopus 로고
    • Efficient Algorithms for the Capacitated Concentrator Location Problem
    • H. PIRKUL, "Efficient Algorithms for the Capacitated Concentrator Location Problem," Computers and Operations Research, 197-208 (1987).
    • (1987) Computers and Operations Research , pp. 197-208
    • Pirkul, H.1
  • 18
    • 0042217162 scopus 로고
    • Siting of Emergency Service Facilities with Workload Capacities and Backup Service
    • H. PIRKUL AND D. SCHILLING, "Siting of Emergency Service Facilities with Workload Capacities and Backup Service," Management Science 34, 896-908 (1988).
    • (1988) Management Science , vol.34 , pp. 896-908
    • Pirkul, H.1    Schilling, D.2
  • 19
    • 0001588414 scopus 로고
    • The Maximal Covering Location Problem with Capacities on Total Workload
    • H. PIRKUL AND D. SCHILLING, "The Maximal Covering Location Problem with Capacities on Total Workload," Management Science 37, 233-248 (1991).
    • (1991) Management Science , vol.37 , pp. 233-248
    • Pirkul, H.1    Schilling, D.2
  • 20
    • 0014597338 scopus 로고
    • Branch-and-Bound and Approximation Solutions to the Capacitated Plant-Location Problem
    • G. SA, "Branch-and-Bound and Approximation Solutions to the Capacitated Plant-Location Problem," Operations Research 17, 1005-1016 (1969).
    • (1969) Operations Research , vol.17 , pp. 1005-1016
    • Sa, G.1
  • 21
    • 0022661931 scopus 로고
    • A Heuristic Lagrangian Algorithm for the Capacitated Plant Location Problem-A Comment
    • R. SRIDHARAN, "A Heuristic Lagrangian Algorithm for the Capacitated Plant Location Problem-A Comment," European Journal of Operational Research 23, 264-265 (1986).
    • (1986) European Journal of Operational Research , vol.23 , pp. 264-265
    • Sridharan, R.1
  • 22
    • 0027591103 scopus 로고
    • A Lagrangian Heuristic for the Capacitated Plant Location Problem With. Single Source Constraints
    • R. SEIDHARAN, "A Lagrangian Heuristic for the Capacitated Plant Location Problem With. Single Source Constraints," European Journal of Operational Research 66, 305-312 (1993).
    • (1993) European Journal of Operational Research , vol.66 , pp. 305-312
    • Seidharan, R.1
  • 23
    • 0347197366 scopus 로고
    • Sciconic Computing Services, Ltd., Milton Keynes, U.K.
    • USERS GUIDE TO SCICONIC/VM, Sciconic Computing Services, Ltd., Milton Keynes, U.K. (1985).
    • (1985) Users Guide to Sciconic/VM
  • 24
    • 0022613611 scopus 로고
    • A Cross Decomposition Algorithm for Capacitated Facility Location
    • T. J. VAN ROY, "A Cross Decomposition Algorithm for Capacitated Facility Location," Operations Research 34, 145-163 (1986).
    • (1986) Operations Research , vol.34 , pp. 145-163
    • Van Roy, T.J.1


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