메뉴 건너뛰기




Volumn 56, Issue 5, 2009, Pages 450-464

Single-warehouse multi-retailer inventory systems with full truckload shipments

Author keywords

Full truckload shipments; Logistics coordination; Multistage inventory

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CAPACITY LIMIT; COMPUTATIONAL BURDEN; COMPUTATIONAL EXPERIMENT; DECENTRALIZED SYSTEM; DYNAMIC LOT-SIZING; FIXED COST; FULL TRUCKLOAD SHIPMENTS; INVENTORY SYSTEMS; LAGRANGIAN DECOMPOSITION; MULTI-STAGE; MULTISTAGE INVENTORY; OPTIMAL SOLUTIONS; PLANNING HORIZONS; POLYNOMIAL-TIME; SHORTEST PATH ALGORITHMS; SINGLE PRODUCT; SINGLE STAGE; TRANSPORTATION COST;

EID: 67749101933     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20353     Document Type: Article
Times cited : (21)

References (21)
  • 1
    • 0012230528 scopus 로고    scopus 로고
    • Optimal lot-sizing/ vehicledispatching policies under stochastic lead times and stepwise fixed costs
    • O. Alp, N. K. Erkip, and R. Güllü, Optimal lot-sizing/ vehicledispatching policies under stochastic lead times and stepwise fixed costs, Oper Res 51(2003), 160-166.
    • (2003) Oper Res , vol.51 , pp. 160-166
    • Alp, O.1    Erkip, N.K.2    Güllü, R.3
  • 2
    • 0031104331 scopus 로고    scopus 로고
    • New formulation and relaxation to solve a concave-cost network flow problem
    • A. Amiri and H. Pirkul, New formulation and relaxation to solve a concave-cost network flow problem, J Oper Res Soc 48(1997), 278-287.
    • (1997) J Oper Res Soc , vol.48 , pp. 278-287
    • Amiri, A.1    Pirkul, H.2
  • 3
    • 19944381224 scopus 로고    scopus 로고
    • Shipping multiple-items by capacitated vehicles an optimal dynamic programming approach
    • S. Anily and M. Tzur, Shipping multiple-items by capacitated vehicles an optimal dynamic programming approach, Trans Sci 39(2005), 233-248.
    • (2005) Trans Sci , vol.39 , pp. 233-248
    • Anily, S.1    Tzur, M.2
  • 4
    • 33645007358 scopus 로고    scopus 로고
    • Algorithms for the multi-item capacitated dynamic lot sizing problem
    • S. Anily and M. Tzur, Algorithms for the multi-item capacitated dynamic lot sizing problem, Naval Res Log 53(2006), 157-169.
    • (2006) Naval Res Log , vol.53 , pp. 157-169
    • Anily, S.1    Tzur, M.2
  • 5
    • 0024641438 scopus 로고
    • Computational complexity of uncapacitated multi-echelon production planning problems
    • E. Arkin, D. Joneja, and R. Roundy, Computational complexity of uncapacitated multi-echelon production planning problems, Oper Res Lett 8(1989), 61-66.
    • (1989) Oper Res Lett , vol.8 , pp. 61-66
    • Arkin, E.1    Joneja, D.2    Roundy, R.3
  • 6
    • 84987049372 scopus 로고
    • A composite algorithm for a concave-cost network flow problem
    • A. Balakrishnan and S. Graves, A composite algorithm for a concave-cost network flow problem, Networks 19(1989), 175-202.
    • (1989) Networks , vol.19 , pp. 175-202
    • Balakrishnan, A.1    Graves, S.2
  • 7
    • 0036877284 scopus 로고    scopus 로고
    • On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures
    • L. M. A. Chan, A. Muriel, Z. J. Shen, and D. Simchi-Levi, On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures, Oper Res 50(2002), 1058-1067.
    • (2002) Oper Res , vol.50 , pp. 1058-1067
    • Chan, L.M.A.1    Muriel, A.2    Shen, Z.J.3    Simchi-Levi, D.4
  • 8
    • 0036870401 scopus 로고    scopus 로고
    • On the effectiveness of zero-inventory-ordering policies for the one-warehouse Multiretailer problem with piecewise linear cost structures
    • L. M. A. Chan, A. Muriel, Z. J. Shen, D. Simchi-Levi, and C. P. Teo, On the effectiveness of zero-inventory-ordering policies for the one-warehouse Multiretailer problem with piecewise linear cost structures, Management Sci 48(2002), 1446-1460.
    • (2002) Management Sci , vol.48 , pp. 1446-1460
    • Chan, L.M.A.1    Muriel, A.2    Shen, Z.J.3    Simchi-Levi, D.4    Teo, C.P.5
  • 9
  • 10
    • 0007077987 scopus 로고
    • Dynamic lot sizing for multi-echelon distribution systems with purchasing and transportation price discounts
    • M. Diaby and A. Martel, Dynamic lot sizing for multi-echelon distribution systems with purchasing and transportation price discounts, Oper Res 41(1993), 48-59.
    • (1993) Oper Res , vol.41 , pp. 48-59
    • Diaby, M.1    Martel, A.2
  • 11
    • 0002077524 scopus 로고    scopus 로고
    • Multicommodity capacitated network design
    • Sansó B and Sociano P, editors, Kluwer Academic Publishers, Norwell, MA
    • B. Gendron, T. G. Crainic, and A. Frangioni, "Multicommodity capacitated network design," in: Sansó B and Sociano P, editors. Telecommunications network planning. Kluwer Academic Publishers, Norwell, MA, 1998, pp. 1-19.
    • (1998) Telecommunications network planning , pp. 1-19
    • Gendron, B.1    Crainic, T.G.2    Frangioni, A.3
  • 12
    • 18144373806 scopus 로고    scopus 로고
    • A dynamic lotsizing model with multi-mode replenishments: Polynomial algorithms for special cases with dual and multiple modes
    • W. Jaruphongsa, S. Çetinkaya, and C. Y. Lee, A dynamic lotsizing model with multi-mode replenishments: Polynomial algorithms for special cases with dual and multiple modes, IIE Trans 37(2005), 453-467.
    • (2005) IIE Trans , vol.37 , pp. 453-467
    • Jaruphongsa, W.1    Çetinkaya, S.2    Lee, C.Y.3
  • 13
    • 67749102761 scopus 로고    scopus 로고
    • PhD Thesis, University of Massachusetts, Amherst
    • Y. Jin, Essays on supply chain management, PhD Thesis, University of Massachusetts, Amherst, 2006.
    • (2006) Essays on supply chain management
    • Jin, Y.1
  • 14
    • 0025454144 scopus 로고
    • The joint replenishment problem: New heuristics and worst case performance bounds
    • D. Joneja, The joint replenishment problem: New heuristics and worst case performance bounds, Oper Res 38(1990), 711-723.
    • (1990) Oper Res , vol.38 , pp. 711-723
    • Joneja, D.1
  • 15
    • 61349193808 scopus 로고    scopus 로고
    • First constant approximation algorithm for the one-warehouse-Multiretailer problem
    • R. Levi, R. Roundy, and D. Shmoys, First constant approximation algorithm for the one-warehouse-Multiretailer problem, Management Sci 54(2008), 763-776.
    • (2008) Management Sci , vol.54 , pp. 763-776
    • Levi, R.1    Roundy, R.2    Shmoys, D.3
  • 16
    • 19444365210 scopus 로고    scopus 로고
    • Dynamic lot sizing with batch ordering and truckload discounts
    • C. L. Li, V. N. Hsu, and W. Q. Xiao, Dynamic lot sizing with batch ordering and truckload discounts, Oper Res 52(2004), 639-654.
    • (2004) Oper Res , vol.52 , pp. 639-654
    • Li, C.L.1    Hsu, V.N.2    Xiao, W.Q.3
  • 17
    • 0014564214 scopus 로고
    • Optimal inventory policy with multiple set-up costs
    • S. Lippman, Optimal inventory policy with multiple set-up costs, Management Sci 16(1969), 118-138.
    • (1969) Management Sci , vol.16 , pp. 118-138
    • Lippman, S.1
  • 18
    • 3042807721 scopus 로고    scopus 로고
    • A dynamic model for inventory lot-sizing and outbound shipment consolidation at a third party warehouse
    • C.-Y. Lee, S. Çentikaya, and W. Jaruphongsa, A dynamic model for inventory lot-sizing and outbound shipment consolidation at a third party warehouse, Oper Res 51(2003), 735-747.
    • (2003) Oper Res , vol.51 , pp. 735-747
    • Lee, C.-Y.1    Çentikaya, S.2    Jaruphongsa, W.3
  • 19
    • 67650838448 scopus 로고    scopus 로고
    • Supply chain design and planning - Applications of optimization techniques for strategic and tactical models
    • A. G, de Kok, S. C, Graves, Editors, Elsevier Publishing Company, Amsterdam, The Netherlands
    • A. Muriel and D. Simchi-Levi, "Supply chain design and planning - Applications of optimization techniques for strategic and tactical models," in: A. G., de Kok, S. C., Graves, (Editors) Supply chain management: Design coordination and operation, Handbooksin Operations Researchand ManagementScience, Volume 11, Elsevier Publishing Company, Amsterdam, The Netherlands, 2004.
    • (2004) Supply chain management: Design coordination and operation, Handbooksin Operations Researchand ManagementScience , vol.11
    • Muriel, A.1    Simchi-Levi, D.2
  • 20
    • 0001547772 scopus 로고
    • Lot-sizing with constant batches: Formulation and valid inequalities
    • Y. Pochet and L. A. Wolsey, Lot-sizing with constant batches: Formulation and valid inequalities, Math Oper Res 18(1993), 767-785.
    • (1993) Math Oper Res , vol.18 , pp. 767-785
    • Pochet, Y.1    Wolsey, L.A.2
  • 21
    • 0010041380 scopus 로고
    • Ageneral method for solving extremum problems
    • in Russian
    • B. T. Polyak, Ageneral method for solving extremum problems (in Russian), Doklady Adademmi Nauk SSSR 174(1967), 33-36.
    • (1967) Doklady Adademmi Nauk SSSR , vol.174 , pp. 33-36
    • Polyak, B.T.1


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