메뉴 건너뛰기




Volumn 51, Issue 7, 2004, Pages 925-948

A probabilistic analysis of a fixed partition policy for the inventory-routing problem

Author keywords

[No Author keywords available]

Indexed keywords

FIXED PARTITION POLICIES (FPP); INVENTORY ROUTING PROBLEMS (IRP); TRANSPORTATION PLANNING; VENDOR MANAGED INVENTORY (VMI);

EID: 6344267061     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.20031     Document Type: Article
Times cited : (14)

References (26)
  • 1
    • 0028683516 scopus 로고
    • The general multi-retailer EOQ problem with vehicle routing costs
    • S. Anily, The general multi-retailer EOQ problem with vehicle routing costs, European J Oper Res 79 (1994), 451-473.
    • (1994) European J Oper Res , vol.79 , pp. 451-473
    • Anily, S.1
  • 2
    • 0003414872 scopus 로고    scopus 로고
    • Vehicle routing and the supply chain
    • S. Tayur, R. Ganeshan, and M. Magazine (Editors), Kluwer, Dordrecht
    • S. Anily and J. Bramel, "Vehicle routing and the supply chain," Quantitative models for supply chain management, S. Tayur, R. Ganeshan, and M. Magazine (Editors), Kluwer, Dordrecht, 1998, pp. 147-196.
    • (1998) Quantitative Models for Supply Chain Management , pp. 147-196
    • Anily, S.1    Bramel, J.2
  • 3
    • 85057633966 scopus 로고    scopus 로고
    • An asymptotic 98.5%-effective lower bound on fixed partition policy for the inventory-routing problem
    • To appear
    • S. Anily and J. Bramel, An asymptotic 98.5%-effective lower bound on fixed partition policy for the inventory-routing problem, Discrete Appl Math, To appear.
    • Discrete Appl Math
    • Anily, S.1    Bramel, J.2
  • 4
    • 0343621925 scopus 로고
    • A class of Euclidean routing problems with general route cost functions
    • S. Anily and A. Federgruen, A class of Euclidean routing problems with general route cost functions, Math Oper Res 15 (1990), 268-285.
    • (1990) Math Oper Res , vol.15 , pp. 268-285
    • Anily, S.1    Federgruen, A.2
  • 5
    • 0002211552 scopus 로고
    • One warehouse multiple retailer systems with vehicle routing costs
    • S. Anily and A. Federgruen, One warehouse multiple retailer systems with vehicle routing costs, Management Sci 36 (1990), 92-114.
    • (1990) Management Sci , vol.36 , pp. 92-114
    • Anily, S.1    Federgruen, A.2
  • 6
    • 0343621923 scopus 로고
    • Rejoinder to "Comments on 'One warehouse multiple retailer systems with vehicle routing costs,'"
    • S. Anily and A. Federgruen, Rejoinder to "Comments on 'One warehouse multiple retailer systems with vehicle routing costs,'" Management Sci 37 (1991), 1498-1499.
    • (1991) Management Sci , vol.37 , pp. 1498-1499
    • Anily, S.1    Federgruen, A.2
  • 7
    • 0003181676 scopus 로고
    • Two-echelon distribution systems with vehicle routing and central inventories
    • Special Issue on Stochastic and Dynamic Models in Transportation [M. Dror (Editor)]
    • S. Anily and A. Federgruen, Two-echelon distribution systems with vehicle routing and central inventories, Special Issue on Stochastic and Dynamic Models in Transportation [M. Dror (Editor)] Oper Res 41 (1993), 37-47.
    • (1993) Oper Res , vol.41 , pp. 37-47
    • Anily, S.1    Federgruen, A.2
  • 8
    • 0001574219 scopus 로고
    • A location based heuristic for general routing problems
    • J. Bramel and D. Simchi-Levi, A location based heuristic for general routing problems, Oper Res 43 (1995), 649-660.
    • (1995) Oper Res , vol.43 , pp. 649-660
    • Bramel, J.1    Simchi-Levi, D.2
  • 9
    • 0031701710 scopus 로고    scopus 로고
    • Probabilistic analyses and practical algorithms for inventory-routing models
    • L.M.A. Chan, A. Federgruen, and D. Simchi-Levi, Probabilistic analyses and practical algorithms for inventory-routing models, Oper Res 46 (1998), 96-106.
    • (1998) Oper Res , vol.46 , pp. 96-106
    • Chan, L.M.A.1    Federgruen, A.2    Simchi-Levi, D.3
  • 11
    • 0002528075 scopus 로고
    • Approximation algorithms for bin-packing - An updated survey
    • G. Ausiello, M. Lucertini, and P. Serafini (Editors), Springer-Verlag, New York
    • E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson, "Approximation algorithms for bin-packing - an updated survey," Algorithm design for computer system design, G. Ausiello, M. Lucertini, and P. Serafini (Editors), Springer-Verlag, New York, 1984, pp. 49-106.
    • (1984) Algorithm Design for Computer System Design , pp. 49-106
    • Coffman Jr., E.G.1    Garey, M.R.2    Johnson, D.S.3
  • 14
    • 0031188458 scopus 로고    scopus 로고
    • Probabilistic analysis of a generalized bin-packing problem and applications
    • A. Federgruen and G. van Ryzin, Probabilistic analysis of a generalized bin-packing problem and applications, Oper Res 45 (1997), 596-609.
    • (1997) Oper Res , vol.45 , pp. 596-609
    • Federgruen, A.1    Van Ryzin, G.2
  • 15
    • 0025376968 scopus 로고
    • On the effectiveness of direct shipping strategy for the one warehouse multi-retailer R-systems
    • G. Gallego and D. Simchi-Levi, On the effectiveness of direct shipping strategy for the one warehouse multi-retailer R-systems, Management Sci 36 (1990), 240-243.
    • (1990) Management Sci , vol.36 , pp. 240-243
    • Gallego, G.1    Simchi-Levi, D.2
  • 16
    • 0022162556 scopus 로고
    • Kan, Bounds and heuristics for capacitated routing problems
    • M. Haimovich and A.H.G. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Math Oper Res 10 (1985), 527-542.
    • (1985) Math Oper Res , vol.10 , pp. 527-542
    • Haimovich, M.1    Rinnooy, A.H.G.2
  • 17
    • 0343621923 scopus 로고
    • Comments on "One warehouse multiple retailer systems with vehicle routing costs,"
    • R.W. Hall, Comments on "One warehouse multiple retailer systems with vehicle routing costs," Management Sci 37 (1991), 1496-1497.
    • (1991) Management Sci , vol.37 , pp. 1496-1497
    • Hall, R.W.1
  • 19
    • 0003590131 scopus 로고
    • The differencing method for set partitioning
    • University of California, Berkeley, CA
    • N. Karmarkar and R.M. Karp, The differencing method for set partitioning, Technical Report, University of California, Berkeley, CA, 1982.
    • (1982) Technical Report
    • Karmarkar, N.1    Karp, R.M.2
  • 20
    • 0017523323 scopus 로고
    • Probabilistic analysis of partitioning algorithms for the traveling salesman problem
    • R.M. Karp, Probabilistic analysis of partitioning algorithms for the traveling salesman problem, Math Oper Res 2 (1977), 209-224.
    • (1977) Math Oper Res , vol.2 , pp. 209-224
    • Karp, R.M.1
  • 21
    • 0001826645 scopus 로고
    • Subadditive processes
    • Springer-Verlag, Berlin
    • J.F.C. Kingman, Subadditive processes, Lecture Notes in Mathematics 539, Springer-Verlag, Berlin, 1976.
    • (1976) Lecture Notes in Mathematics , vol.539
    • Kingman, J.F.C.1
  • 24
    • 0001231127 scopus 로고
    • Martingale inequalities and N-P-complete problems
    • W.T. Rhee and M. Talagrand, Martingale inequalities and N-P-complete problems, Math Oper Res 12 (1987), 177-181.
    • (1987) Math Oper Res , vol.12 , pp. 177-181
    • Rhee, W.T.1    Talagrand, M.2
  • 25
    • 0026824199 scopus 로고
    • Competing on capabilities: The new rule of corporate strategy
    • G. Stalk, P. Evans, and L.E. Shulman, Competing on capabilities: The new rule of corporate strategy, Harvard Bus Rev 70 (1992), 57-69.
    • (1992) Harvard Bus Rev , vol.70 , pp. 57-69
    • Stalk, G.1    Evans, P.2    Shulman, L.E.3


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