메뉴 건너뛰기




Volumn , Issue , 2011, Pages 67-79

A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem

Author keywords

[No Author keywords available]

Indexed keywords

INVENTORY CONTROL; SALES; WAREHOUSES;

EID: 79955705641     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.6     Document Type: Conference Paper
Times cited : (13)

References (19)
  • 2
    • 0001233812 scopus 로고
    • Improved, algorithms for economic lot-size problems
    • A. AGGARWAL AND J. K. PARK, Improved, algorithms for economic lot-size problems, Operations Research, 41 (1993), pp. 549-571.
    • (1993) Operations Research , vol.41 , pp. 549-571
    • Aggarwal, A.1    Park, J.K.2
  • 4
    • 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, Operations Research Letters, 8 (1989), pp. 61-66.
    • (1989) Operations Research Letters , vol.8 , pp. 61-66
    • Arkin, E.1    Joneja, D.2    Roundy, R.3
  • 5
    • 0036870401 scopus 로고    scopus 로고
    • Effective zero- inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures
    • L. M. A. CHAN, A. MURIEL, Z.-J. M. SHEN, D. SIMCHI-LEVI, AND C.-P. TEO, Effective zero- inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures, Management Science, 48 (2000), pp. 1446-1460.
    • (2000) Management Science , vol.48 , pp. 1446-1460
    • Chan, L.M.A.1    Muriel, A.2    Shen, Z.-J.M.3    Simchi-Levi, D.4    Teo, C.-P.5
  • 6
    • 38249019226 scopus 로고
    • Sequence comparison with mixed convex and concave costs
    • D. EPPSTEIN, Sequence comparison with mixed convex and concave costs, Journal of Algorithms, 11 (1990), pp. 85-101.
    • (1990) Journal of Algorithms , vol.11 , pp. 85-101
    • Eppstein, D.1
  • 7
    • 0026208005 scopus 로고
    • Simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time
    • A. FEDERGRUEN AND M. TZUR, A simple forward algorithm to solve the general dynamic lot-sizing models with n periods in 0(n log n) or 0(n) time, Management Science, 37 (1991), pp. 909-925. (Pubitemid 23585668)
    • (1991) Management Science , vol.37 , Issue.8 , pp. 909-925
    • Federgruen Awi1    Tzur Michal2
  • 8
    • 0004601104 scopus 로고    scopus 로고
    • Time-Partitioning Heuristics: Application to One Warehouse, Multiitem, Multiretailer Lot-Sizing Problems
    • A. FEDERGRUEN AND M. TZUR, Time-partitioning heuristics: Application to one-warehouse, multi-item, multi-retailer lot-sizing problems, Naval Research Logistics, 46 (1999), pp. 463-486. (Pubitemid 129584916)
    • (1999) Naval Research Logistics , vol.46 , Issue.5 , pp. 463-486
    • Federgruen, A.1    Tzur, M.2
  • 9
    • 0032108328 scopus 로고    scopus 로고
    • A treshold o/Iog(n) for approximating set-cover
    • U. FEIGE, A treshold o/Iog(n) for approximating set-cover, J. ACM, 45 (1998), pp. 634-652.
    • (1998) J. ACM , vol.45 , pp. 634-652
    • Feige, U.1
  • 10
    • 35348948363 scopus 로고    scopus 로고
    • A review of the joint replenishment problem literature: 1989-2005
    • DOI 10.1016/j.ejor.2007.03.007, PII S0377221707003037
    • M. KHOUJA and G. S.. A review of the joint replenishment problem literature: 1989-2005, European Journal of Operational Research, 186 (2008), pp. 1-16. (Pubitemid 47600543)
    • (2008) European Journal of Operational Research , vol.186 , Issue.1 , pp. 1-16
    • Khouja, M.1    Goyal, S.2
  • 11
    • 33748419367 scopus 로고    scopus 로고
    • Primal-dual algorithms for deterministic inventory problems
    • DOI 10.1287/moor.1050.0178
    • R. LEVI, R. ROUNDY, AND D. SHMOYS, Primal-dual algorithms for deterministic inventory problems, Mathematics of Operations Research, 31 (2006), pp. 267-284. (Pubitemid 44343591)
    • (2006) Mathematics of Operations Research , vol.31 , Issue.2 , pp. 267-284
    • Levi, R.1    Roundy, R.O.2    Shmoys, D.B.3
  • 12
    • 61349193808 scopus 로고    scopus 로고
    • A constant approximation algorithm for the one-warehouse multiretailer problem
    • R. LEVI, R. ROUNDY, D. SHMOYS, AND M. SVIRI-DENKO, A constant approximation algorithm for the one-warehouse multiretailer problem, Management Science, 54 (2008), pp. 763-776.
    • (2008) Management Science , vol.54 , pp. 763-776
    • Levi, R.1    Roundy, R.2    Shmoys, D.3    Sviri-Denko, M.4
  • 13
    • 77957038373 scopus 로고
    • Analysis of multistage production systems
    • Chapter 2
    • J. MUCKSTADT AND R. R.O., Analysis of multistage production systems, Handbooks in OR and MS, (1993). (Chapter 2).
    • (1993) Handbooks in OR and MS
    • Muckstadt, J.1    R, R.O.2
  • 15
    • 0022162807 scopus 로고
    • A 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems
    • R. O. ROUNDY, A 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems, Management Science. 31 (1985), pp. 1416-1430.
    • (1985) Management Science , vol.31 , pp. 1416-1430
    • Roundy, R.O.1
  • 16
    • 0000976702 scopus 로고
    • A simple continuous review deterministic one-warehouse n-retailer inventory problem
    • L. B. SCHWARZ, A simple continuous review deterministic one-warehouse n-retailer inventory problem, Management Science, 19 (1973), pp. 555-566.
    • (1973) Management Science , vol.19 , pp. 555-566
    • Schwarz, L.B.1
  • 17
    • 70349604128 scopus 로고    scopus 로고
    • Approximation algorithms for general one-warehouse multi-retailer systems
    • Z.-J. SHEN, J. SHU, D. SIMCHI-LEVI, C.-P.TEO, AND J. ZHANG, Approximation algorithms for general one-warehouse multi-retailer systems, Naval Research Logistics, 56 (2009), pp. 642-658.
    • (2009) Naval Research Logistics , vol.56 , pp. 642-658
    • Shen, Z.-J.1    Shu, J.2    Simchi-Levi, D.3    Teo, C.-P.4    Zhang, J.5
  • 19
    • 0000495984 scopus 로고
    • Economic lot sizing: An 0(n log n) algorithm that runs in linear time in the wagner-whitin case
    • A. WAGELMANS, S. V. HOESEL, AND A. KOLEN, Economic lot sizing: an 0(n log n) algorithm that runs in linear time in the wagner-whitin case, Operations Research, 40 (1992), pp. 145-156.
    • (1992) Operations Research , vol.40 , pp. 145-156
    • Wagelmans, A.1    Hoesel, S.V.2    Kolen, A.3


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