메뉴 건너뛰기




Volumn 48, Issue 11, 2002, Pages 1446-1460

Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures

Author keywords

Approximation algorithms; Inventory; Less than truckload (LTL); Tranportation; Truckload (TL); Zero invertory ordering policies

Indexed keywords

ALGORITHMS; CARGO HANDLING; COST EFFECTIVENESS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; WAREHOUSES;

EID: 0036870401     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.48.11.1446.267     Document Type: Article
Times cited : (124)

References (7)
  • 1
    • 0024641438 scopus 로고
    • Computational complexity of uncapacitated multi-echelon production planning problems
    • Arkin E., D. Joneja, R. Roundy. 1989. Computational complexity of uncapacitated multi-echelon production planning problems. Oper. Res. Lett. 8 61-66.
    • (1989) Oper. Res. Lett. , vol.8 , pp. 61-66
    • Arkin, E.1    Joneja, D.2    Roundy, R.3
  • 3
    • 4243578340 scopus 로고    scopus 로고
    • Production/distribution planning problems with piece-wise linear and concave cost structures
    • Working paper, Northwestern University, Evanston, IL
    • Chan, L. M. A., A. Muriel, D. Simchi-Levi 1999a. Production/distribution planning problems with piece-wise linear and concave cost structures. Working paper, Northwestern University, Evanston, IL.
    • (1999)
    • Chan, L.M.A.1    Muriel, A.2    Simchi-Levi, D.3
  • 4
    • 0012418358 scopus 로고    scopus 로고
    • On the effectiveness of zero-inventory-ordering policies for the economic lot sizing problem with a class of piece-wise linear cost structures
    • Forthcoming
    • ____, ____, Z. J. Shen, D. Simchi-Levi. 1999b. On the effectiveness of zero-inventory-ordering policies for the economic lot sizing problem with a class of piece-wise linear cost structures. Oper. Res. Forthcoming.
    • (1999) Oper. Res.
    • Chan, L.M.A.1    Muriel, A.2    Shen, Z.J.3    Simchi-Levi, D.4
  • 6
    • 0032108328 scopus 로고    scopus 로고
    • A threshold of ln n for approximating set cover
    • Feige, U. 1998. A threshold of ln n for approximating set cover. J. ACM 45(4) 634-652.
    • (1998) J. ACM , vol.45 , Issue.4 , pp. 634-652
    • Feige, U.1
  • 7
    • 0025454144 scopus 로고
    • The joint replenishment problem: New heuristics and worst case performance bounds
    • Joneja, D. 1990. The joint replenishment problem: New heuristics and worst case performance bounds. Oper. Res. 38(4) 711-723.
    • (1990) Oper. Res. , vol.38 , Issue.4 , pp. 711-723
    • Joneja, D.1


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