메뉴 건너뛰기
Operations Research Letters
Volumn 36, Issue 3, 2008, Pages 297-299
An O (n2) algorithm for lot sizing with inventory bounds and fixed costs
Author keywords

Dynamic programming; Extreme points; Lot sizing
Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; FUNCTIONS; INVENTORY CONTROL; OPERATING COSTS;
EID: 42949138212     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2007.08.004     Document Type: Article
Times cited : (33)
References (7)
  • 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
    • 25144467855 scopus 로고    scopus 로고
    • Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation
    • Atamtürk A., and Küçükyavuz S. Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation. Operations Research 53 (2005) 711-730
    • (2005) Operations Research , vol.53 , pp. 711-730
    • Atamtürk, A.1    Küçükyavuz, S.2
  • 3
    • 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
    • 42949162324 scopus 로고    scopus 로고
    • Sun Microsystems Inc. Press Release: Sun Microsystems launches innovative new programs to simplify storage acquisition and management. http://www.sun.com/smi/Press/sunflash/2005-05/sunflash.20050503.3.xml, 2005
    • Sun Microsystems Inc. Press Release: Sun Microsystems launches innovative new programs to simplify storage acquisition and management. http://www.sun.com/smi/Press/sunflash/2005-05/sunflash.20050503.3.xml, 2005
  • 6
    • 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
  • 7
    • 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

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