메뉴 건너뛰기




Volumn 38, Issue 12, 2011, Pages 1731-1746

Analysis of the maximum level policy in a production-distribution system

Author keywords

Computational complexity; Exact and hybrid heuristic algorithms; Inventory; Logistics; Production; Transportation

Indexed keywords

COMPUTATIONAL EXPERIMENT; EXACT ALGORITHMS; EXACT AND HYBRID HEURISTIC ALGORITHMS; HIGH-QUALITY SOLUTIONS; HYBRID HEURISTICS; INVENTORY; INVENTORY COSTS; NP-HARD; OVERALL COSTS; POLYNOMIAL-TIME; PROBLEM INSTANCES; PRODUCTION POLICY; PRODUCTION-DISTRIBUTION SYSTEMS; REPLENISHMENT POLICY; SMALL SIZE; SYSTEM COSTS; TRANSPORTATION POLICIES; VARIABLE PRODUCTION; WORST-CASE PERFORMANCE;

EID: 79955067887     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.03.002     Document Type: Article
Times cited : (124)

References (21)
  • 5
    • 0023984228 scopus 로고
    • Strategic analysis of integrated production-distribution systems: Models and methods
    • M.A. Cohen, and H.L. Lee Strategic analysis of integrated production-distribution systems: models and methods Operations Research 35 1988 216 228
    • (1988) Operations Research , vol.35 , pp. 216-228
    • Cohen, M.A.1    Lee, H.L.2
  • 6
    • 0041760308 scopus 로고    scopus 로고
    • Coordinated supply chain management
    • DOI 10.1016/0377-2217(96)00098-7, PII S0377221796000987
    • D.J. Thomas, and P.M. Griffin Coordinated supply chain management European Journal of Operational Research 94 1996 1 15 (Pubitemid 126390424)
    • (1996) European Journal of Operational Research , vol.94 , Issue.1 , pp. 1-15
    • Thomas, D.J.1    Griffin, P.M.2
  • 11
    • 0036474929 scopus 로고    scopus 로고
    • Deterministic order-up-to level policies in an inventory routing problem
    • DOI 10.1287/trsc.36.1.119.573
    • L. Bertazzi, G. Paletta, and M.G. Speranza Deterministic order-up-to level policies in an inventory routing problem Transportation Science 36 2002 119 132 (Pubitemid 34268737)
    • (2002) Transportation Science , vol.36 , Issue.1 , pp. 119-132
    • Bertazzi, L.1    Paletta, G.2    Speranza, M.G.3
  • 12
    • 26844451403 scopus 로고    scopus 로고
    • Minimizing the total cost in an integrated vendor-managed inventory system
    • DOI 10.1007/s10732-005-0616-6, Supply Chain and Distribution Management
    • L. Bertazzi, G. Paletta, and M.G. Speranza Minimizing the total cost in an integrated vendor-managed inventory system Journal of Heuristics 11 2005 393 419 (Pubitemid 41444229)
    • (2005) Journal of Heuristics , vol.11 , Issue.SPEC. ISS. 5-6 , pp. 393-419
    • Bertazzi, L.1    Paletta, G.2    Speranza, M.G.3
  • 13
    • 0018153235 scopus 로고
    • An algorithm for the dynamic lot-size problem with time-varying production capacity constraints
    • K.R. Baker, P. Dixon, M.J. Magazine, and E.A. Silver An algorithm for the dynamic lot-size problem with time-varying production capacity constraints Management Science 24 1978 1710 1720 (Pubitemid 9444885)
    • (1978) Manage Sci , vol.24 , Issue.16 , pp. 1710-1720
    • Baker Kenneth, R.1    Paul, D.2    Magazine Michael, J.3    Silver Edward, A.4
  • 15
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot size model
    • H.M. Wagner, and T.M. Whitin Dynamic version of the economic lot size model Management Science 5 1958 89 96
    • (1958) Management Science , vol.5 , pp. 89-96
    • Wagner, H.M.1    Whitin, T.M.2
  • 16
    • 0019032810 scopus 로고
    • Deterministic production planning: algorithms and complexity
    • M. Florian, J.K. Lenstra, and H.G. Rinnooy Kan Deterministic production planning: algorithms and complexity Management Science 26 1980 669 679 (Pubitemid 11442296)
    • (1980) Management Science , vol.26 , Issue.7 , pp. 669-679
    • Florian, M.1    Lenstra, J.K.2    Kan A.M.G.Rinnooy3
  • 17
    • 0001278313 scopus 로고    scopus 로고
    • Solving the Orienteering Problem through branch-and-cut
    • M. Fischetti, J.J. Salazar-González, and P. Toth Solving the orienteering problem through branch and cut INFORMS Journal of Computing 10 1998 133 148 (Pubitemid 128669123)
    • (1998) INFORMS Journal on Computing , vol.10 , Issue.2 , pp. 133-148
    • Fischetti, M.1    Gonzalez, J.J.S.2    Toth, P.3
  • 18
    • 0039392730 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the undirected selective traveling salesman problem
    • M. Gendreau, G. Laporte, and F. Semet A branch-and-cut algorithm for the undirected selective traveling salesman problem Networks 32 1998 263 273 (Pubitemid 128365136)
    • (1998) Networks , vol.32 , Issue.4 , pp. 263-273
    • Gendreau, M.1    Laporte, G.2    Semet, F.3
  • 20
    • 0026124209 scopus 로고
    • A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
    • M. Padberg, and G. Rinaldi A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems SIAM Review 33 1991 60 100
    • (1991) SIAM Review , vol.33 , pp. 60-100
    • Padberg, M.1    Rinaldi, G.2
  • 21
    • 67349167929 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for a vendor managed inventory routing problem
    • C. Archetti, L. Bertazzi, G. Laporte, and M.G. Speranza A branch-and-cut algorithm for a vendor managed inventory routing problem Transportation Science 41 2007 382 391
    • (2007) Transportation Science , vol.41 , pp. 382-391
    • Archetti, C.1    Bertazzi, L.2    Laporte, G.3    Speranza, M.G.4


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