메뉴 건너뛰기




Volumn 43, Issue 4, 2015, Pages 359-364

A polynomial time algorithm for convex cost lot-sizing problems

Author keywords

Convex cost lot sizing; Polynomial time algorithms; Production and inventory systems; Supply chain management

Indexed keywords

COSTS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PRODUCTION CONTROL; SUPPLY CHAIN MANAGEMENT;

EID: 84929305281     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2015.03.009     Document Type: Article
Times cited : (4)

References (12)
  • 2
    • 0025263096 scopus 로고
    • A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
    • S. Erenguc, and Y. Aksoy A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints Comput. Oper. Res. 17 2 1990 199 210
    • (1990) Comput. Oper. Res. , vol.17 , Issue.2 , pp. 199-210
    • Erenguc, S.1    Aksoy, Y.2
  • 3
    • 78049441233 scopus 로고    scopus 로고
    • Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O (N log N) time
    • Y. Feng, S. Chen, A. Kumar, and B. Lin Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O (N log N) time Comput. Oper. Res. 38 4 2011 717 722
    • (2011) Comput. Oper. Res. , vol.38 , Issue.4 , pp. 717-722
    • Feng, Y.1    Chen, S.2    Kumar, A.3    Lin, B.4
  • 4
    • 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 Manag. Sci. 18 1 1971 12 20
    • (1971) Manag. Sci. , vol.18 , Issue.1 , pp. 12-20
    • Florian, M.1    Klein, M.2
  • 5
    • 0019032810 scopus 로고
    • Deterministic production planning: Algorithms and complexity
    • M. Florian, J. Lenstra, and A. Rinnooy Kan Deterministic production planning: Algorithms and complexity Manag. Sci. 26 7 1980 669 679
    • (1980) Manag. Sci. , vol.26 , Issue.7 , pp. 669-679
    • Florian, M.1    Lenstra, J.2    Rinnooy Kan, A.3
  • 6
    • 0002171449 scopus 로고
    • On optimality conditions in nondifferentiable programming
    • J. Hiriart-Urruty On optimality conditions in nondifferentiable programming Math. Program. 14 1978 73 86
    • (1978) Math. Program. , vol.14 , pp. 73-86
    • Hiriart-Urruty, J.1
  • 7
    • 84906251940 scopus 로고    scopus 로고
    • The dynamic lot-sizing problem with convex economic production costs and setups
    • R. Kian, Ü Gürler, and E. Berk The dynamic lot-sizing problem with convex economic production costs and setups Int. J. Prod. Econ. 155 2014 361 379
    • (2014) Int. J. Prod. Econ. , vol.155 , pp. 361-379
    • Kian, R.1    Gürler, Ü.2    Berk, E.3
  • 8
    • 0032094448 scopus 로고    scopus 로고
    • An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
    • D. Shaw, and A. Wagelmans An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs Manag. Sci. 44 6 1998 831 838
    • (1998) Manag. Sci. , vol.44 , Issue.6 , pp. 831-838
    • Shaw, D.1    Wagelmans, A.2
  • 9
    • 46449112674 scopus 로고    scopus 로고
    • Four equivalent lot-sizing models
    • W. van den Heuvel, and A. Wagelmans Four equivalent lot-sizing models Oper. Res. Lett. 36 4 2008 465 470
    • (2008) Oper. Res. Lett. , vol.36 , Issue.4 , pp. 465-470
    • Van Den Heuvel, W.1    Wagelmans, A.2
  • 10
    • 0035351621 scopus 로고    scopus 로고
    • Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems
    • C. van Hoesel, and A. Wagelmans Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems Math. Oper. Res. 26 2 2001 339 357
    • (2001) Math. Oper. Res. , vol.26 , Issue.2 , pp. 339-357
    • Van Hoesel, C.1    Wagelmans, A.2
  • 11
    • 0001405159 scopus 로고
    • Production planning with convex costs: A parametric study
    • A. Veinott Jr. Production planning with convex costs: A parametric study Manag. Sci. 10 3 1964 441 460
    • (1964) Manag. Sci. , vol.10 , Issue.3 , pp. 441-460
    • Veinott, A.1
  • 12
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot size model
    • H. Wagner, and T. Whitin Dynamic version of the economic lot size model Manag. Sci. 5 1958 89 96
    • (1958) Manag. Sci. , vol.5 , pp. 89-96
    • Wagner, H.1    Whitin, T.2


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