메뉴 건너뛰기




Volumn 222, Issue 1, 2012, Pages 10-16

A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs

Author keywords

Capacity constraint; Lot sizing; Minimum order quantity; Polynomial time algorithm

Indexed keywords

CAPACITATED LOT SIZING PROBLEM; CAPACITY CONSTRAINTS; CONCAVE COST; LOT SIZING; MINIMUM ORDER QUANTITIES; PLANNING HORIZONS; POLYNOMIAL-TIME ALGORITHMS; PRODUCTION CAPACITY; STORAGE COSTS;

EID: 84861796333     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.04.024     Document Type: Article
Times cited : (26)

References (13)
  • 5
    • 0032001763 scopus 로고    scopus 로고
    • Lower bounds in lot-sizing models: A polyhedral study
    • M. Constantino Lower bounds in lot-sizing models: a polyhedral study Mathematics of Operations Research 23 1 1998 101 118 (Pubitemid 128628153)
    • (1998) Mathematics of Operations Research , vol.23 , Issue.1 , pp. 101-118
    • Constantino, M.1
  • 6
    • 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 1 1971 12 20
    • (1971) Management Science , vol.18 , Issue.1 , pp. 12-20
    • Florian, M.1    Klein, M.2
  • 8
    • 3042815391 scopus 로고    scopus 로고
    • Inventory replenishment model: Lot sizing versus just-in-time delivery
    • C.-Y. Lee Inventory replenishment model: lot sizing versus just-in-time delivery Operations Research Letters 32 6 2004 581 590
    • (2004) Operations Research Letters , vol.32 , Issue.6 , pp. 581-590
    • Lee, C.-Y.1
  • 10
    • 79952192401 scopus 로고    scopus 로고
    • 3) algorithm for the capacitated lot sizing problem with minimum order quantities
    • 3) algorithm for the capacitated lot sizing problem with minimum order quantities European Journal of Operational Research 211 3 2011 507 514
    • (2011) European Journal of Operational Research , vol.211 , Issue.3 , pp. 507-514
    • Okhrin, I.1    Richter, K.2
  • 11
    • 33746851250 scopus 로고    scopus 로고
    • An efficient optimal solution method for the joint replenishment problem with minimum order quantities
    • DOI 10.1016/j.ejor.2005.02.056, PII S0377221705002699
    • E. Porras, and R. Dekker An efficient optimal solution method for the joint replenishment problem with minimum order quantities European Journal of Operational Research 174 3 2006 1595 1615 (Pubitemid 44176263)
    • (2006) European Journal of Operational Research , vol.174 , Issue.3 , pp. 1595-1615
    • Porras, E.1    Dekker, R.2
  • 12
    • 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 1 1996 142 150 (Pubitemid 126545091)
    • (1996) Management Science , vol.42 , Issue.1 , pp. 142-150
    • Van Hoesel, C.P.M.1    Wagelmans, A.P.M.2
  • 13
    • 33846443260 scopus 로고    scopus 로고
    • Effective control policies for stochastic inventory systems with a minimum order quantity and linear costs
    • DOI 10.1016/j.ijpe.2006.06.020, PII S0925527306001988
    • B. Zhou, Y. Zhao, and M.N. Katehakis Effective control policies for stochastic inventory systems with a minimum order quantity and linear costs International Journal of Production Economics 106 2 2007 523 531 (Pubitemid 46149249)
    • (2007) International Journal of Production Economics , vol.106 , Issue.2 , pp. 523-531
    • Zhou, B.1    Zhao, Y.2    Katehakis, M.N.3


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