메뉴 건너뛰기




Volumn 48, Issue 2, 2005, Pages 85-90

Coordinating deliveries and inventories for a supply chain under vendor managed inventory system

Author keywords

Operation planning; Scheduling

Indexed keywords

COST EFFECTIVENESS; HEURISTIC METHODS; MATHEMATICAL MODELS; TRAVELING SALESMAN PROBLEM;

EID: 21244476303     PISSN: 13447912     EISSN: None     Source Type: Journal    
DOI: 10.1299/jsmea.48.85     Document Type: Article
Times cited : (12)

References (12)
  • 1
    • 1642324107 scopus 로고    scopus 로고
    • Dynamic Programming Approximations for a Stochastic Inventory Routing Problem
    • Kleywegt, A.J., Nori, V.S. and Savelsbergh, M.W.P., Dynamic Programming Approximations for a Stochastic Inventory Routing Problem, Transportation Science, Vol.38 (2004), pp.42-70.
    • (2004) Transportation Science , vol.38 , pp. 42-70
    • Kleywegt, A.J.1    Nori, V.S.2    Savelsbergh, M.W.P.3
  • 2
    • 0033902373 scopus 로고    scopus 로고
    • Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems
    • Cetinkaya, S. and Lee, C.W., Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems, Management Science, Vol.46, No.2 (2000), pp.217-232
    • (2000) Management Science , vol.46 , Issue.2 , pp. 217-232
    • Cetinkaya, S.1    Lee, C.W.2
  • 5
    • 0021439402 scopus 로고
    • The Period Routing Problem
    • Christofides, N. and Beasley, J.E., The Period Routing Problem, Networks, Vol.14 (1984), pp.237-256.
    • (1984) Networks , vol.14 , pp. 237-256
    • Christofides, N.1    Beasley, J.E.2
  • 6
    • 0026943642 scopus 로고
    • A Multiperiod Traveling Salesman Problem: Heuristic Algorithms
    • Paletta, G., A Multiperiod Traveling Salesman Problem: Heuristic Algorithms, Computers & Operations Research, Vol.19 (1992), pp.789-795.
    • (1992) Computers & Operations Research , vol.19 , pp. 789-795
    • Paletta, G.1
  • 7
  • 8
    • 0041194626 scopus 로고    scopus 로고
    • A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems
    • Cordeau, J.F., Gendreau, M. and Laporte, G., A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems, Networks, Vol.30 (1997), pp.105-119.
    • (1997) Networks , vol.30 , pp. 105-119
    • Cordeau, J.F.1    Gendreau, M.2    Laporte, G.3
  • 9
    • 0036722159 scopus 로고    scopus 로고
    • The Period Traveling Salesman Problem: A New Heuristic Algorithm
    • Paletta, G., The Period Traveling Salesman Problem: a New Heuristic Algorithm, Computers & Operations Research, Vol.29, Issue 10 (2002), pp.1343-1352.
    • (2002) Computers & Operations Research , vol.29 , Issue.10 , pp. 1343-1352
    • Paletta, G.1
  • 10
    • 1642411093 scopus 로고    scopus 로고
    • An Improved Heuristic for the Period Traveling Salesman Problem
    • Bertazzi, L., Paletta, G. and Speranza, M.G., An Improved Heuristic for the Period Traveling Salesman Problem, Computers & Operations Research, Vol.31 (2004), pp.1215-1222.
    • (2004) Computers & Operations Research , vol.31 , pp. 1215-1222
    • Bertazzi, L.1    Paletta, G.2    Speranza, M.G.3
  • 11
    • 84908780328 scopus 로고
    • Computer Solutions of the Traveling Salesman Problem
    • Lin, S., Computer Solutions of the Traveling Salesman Problem, Bell Syst. Tech. J., Vol.65 (1965), pp.2245-2269.
    • (1965) Bell Syst. Tech. J. , vol.65 , pp. 2245-2269
    • Lin, S.1


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