메뉴 건너뛰기
Computers and Operations Research
Volumn 33, Issue 12, 2006, Pages 3583-3599
An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
Author keywords

Capacitated lot sizing; Inventory; Production
Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DYNAMIC PROGRAMMING; NUMERICAL METHODS; POLYNOMIAL APPROXIMATION; PRODUCTION;
EID: 33645159327     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.02.046     Document Type: Article
Times cited : (20)
References (11)
  • 1
    • 0019032810 scopus 로고
    • Deterministic production planning: Algorithms and complexity
    • M. Florian, J.K. Lenstra, and A.H.G. Rinnooy Kan Deterministic production planning: algorithms and complexity Management Science 26 1980 669 679
    • (1980) Management Science , vol.26 , pp. 669-679
    • Florian, M.1    Lenstra, J.K.2    Rinnooy Kan, A.H.G.3
  • 2
    • 0032094448 scopus 로고    scopus 로고
    • An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
    • D.X. Shaw, and A.P.M. Wagelmans An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs Management Science 44 1998 831 838
    • (1998) Management Science , vol.44 , pp. 831-838
    • Shaw, D.X.1    Wagelmans, A.P.M.2
  • 3
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot size model
    • H.M. Wagner, and T.M. Whitin 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
  • 4
    • 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
    • A. Federgruen, and M. Tzur 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
  • 5
    • 0000495984 scopus 로고
    • Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case
    • A.P.M. Wagelmans, C.P.M. Van Hoesel, and A. Kolen 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.P.M.1    Van Hoesel, C.P.M.2    Kolen, A.3
  • 6
    • 0001233812 scopus 로고
    • Improved algorithms for economic lot-size problems
    • A. Aggarwal, and J.K. Park Improved algorithms for economic lot-size problems Operations Research 14 1993 549 571
    • (1993) Operations Research , vol.14 , pp. 549-571
    • Aggarwal, A.1    Park, J.K.2
  • 7
    • 0020194024 scopus 로고
    • Computational complexity of the capacitated lot size problem
    • G.R. Bitran, and H.H. Yanasse Computational complexity of the capacitated lot size problem Management Science 28 1982 1174 1186
    • (1982) Management Science , vol.28 , pp. 1174-1186
    • Bitran, G.R.1    Yanasse, H.H.2
  • 8
    • 0002144134 scopus 로고
    • Deterministic production planning with concave costs and capacity constraints
    • M. Florian, and M. Klein Deterministic production planning with concave costs and capacity constraints Management Science 18 1971 12 20
    • (1971) Management Science , vol.18 , pp. 12-20
    • Florian, M.1    Klein, M.2
  • 9
    • 0001491020 scopus 로고    scopus 로고
    • 3) algorithm for the economic lot-sizing problem with constant capacities
    • 3) algorithm for the economic lot-sizing problem with constant capacities Management Science 42 1996 142 150
    • (1996) Management Science , vol.42 , pp. 142-150
    • Van Hoesel, C.P.M.1    Wagelmans, A.P.M.2
  • 10
    • 0001537142 scopus 로고
    • 2) algorithm for the NI/G/NI/ND capacitated lot size problem
    • 2) algorithm for the NI/G/NI/ND capacitated lot size problem Management Science 34 1988 420 426
    • (1988) Management Science , vol.34 , pp. 420-426
    • Chung, C.S.1    Lin, C.H.M.2
  • 11
    • 0000635282 scopus 로고
    • A new dynamic programming algorithm for the single item capacitated lot size model
    • H.-D. Chen, D.W. Hearn, and C.-Y. Lee A new dynamic programming algorithm for the single item capacitated lot size model Journal of Global Optimization 4 1994 285 300
    • (1994) Journal of Global Optimization , vol.4 , pp. 285-300
    • Chen, H.-D.1    Hearn, D.W.2    Lee, C.-Y.3

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