메뉴 건너뛰기




Volumn 189, Issue 3, 2008, Pages 682-693

An efficient approach for solving the lot-sizing problem with time-varying storage capacities

Author keywords

Capacity; Computational improvement; Dynamic programming; Inventory production: policies; Lot sizing

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COST ACCOUNTING; DATA STORAGE EQUIPMENT; OPTIMAL SYSTEMS; TIME VARYING SYSTEMS;

EID: 40849145455     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.09.096     Document Type: Article
Times cited : (15)

References (11)
  • 1
    • 0001233812 scopus 로고
    • Improved algorithms for economic lot size problems
    • Aggarwal A., and Park J.K. Improved algorithms for economic lot size problems. Operations Research 41 (1993) 549-571
    • (1993) Operations Research , vol.41 , pp. 549-571
    • Aggarwal, A.1    Park, J.K.2
  • 2
    • 0026208005 scopus 로고
    • A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time
    • Federgruen A., and Tzur M. A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time. Management Science 37 (1991) 909-925
    • (1991) Management Science , vol.37 , pp. 909-925
    • Federgruen, A.1    Tzur, M.2
  • 4
    • 0001705761 scopus 로고
    • Bounded production and inventory models with piecewise concave costs
    • Love S.F. Bounded production and inventory models with piecewise concave costs. Management Science 20 (1973) 313-318
    • (1973) Management Science , vol.20 , pp. 313-318
    • Love, S.F.1
  • 5
    • 0001372404 scopus 로고
    • Programming of economic lot sizes
    • Manne A.S. Programming of economic lot sizes. Management Science 4 (1958) 115-135
    • (1958) Management Science , vol.4 , pp. 115-135
    • Manne, A.S.1
  • 8
    • 0000495984 scopus 로고
    • Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case
    • Wagelmans A., Van Hoesel S., and Kolen A. Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Operations Research 40 (1992) S145-S156
    • (1992) Operations Research , vol.40
    • Wagelmans, A.1    Van Hoesel, S.2    Kolen, A.3
  • 9
    • 0040913946 scopus 로고
    • A postscript to dynamic problems in the theory of the firm
    • Wagner H.M. A postscript to dynamic problems in the theory of the firm. Naval Research Logistics Quarterly 7 (1960) 7-12
    • (1960) Naval Research Logistics Quarterly , vol.7 , pp. 7-12
    • Wagner, H.M.1
  • 10
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot size model
    • Wagner H.M., and Whitin T.M. Dynamic version of the economic lot size model. Management Science 5 (1958) 89-96
    • (1958) Management Science , vol.5 , pp. 89-96
    • Wagner, H.M.1    Whitin, T.M.2
  • 11
    • 0000295676 scopus 로고
    • Minimum concave cost flows in certain networks
    • Zangwill W.I. Minimum concave cost flows in certain networks. Management Science 14 (1968) 429-450
    • (1968) Management Science , vol.14 , pp. 429-450
    • Zangwill, W.I.1


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