Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost

Operations Research Letters

Volumn 40, Issue 5, 2012, Pages 390-397

  Akbalik, Ayse ^a   Rapine, Christophe ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Capacitated lot sizing problem; Dynamic programming; Polynomial time algorithm; Single item; Stepwise costs

Indexed keywords

BATCH PRODUCTION; BATCH SIZES; CAPACITATED LOT SIZING PROBLEM; COST STRUCTURE; LOT SIZING PROBLEMS; OPTIMALITY; POLYNOMIAL-TIME ALGORITHMS; PRODUCTION CAPACITY; PRODUCTION COST; SINGLE-ITEM; TIME ALGORITHMS;

COSTS; DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION;

PRODUCTION CONTROL;

EID: 84864431343     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2012.05.003     Document Type: Article

References (18)

1. A. Akbalik, and B. Penz Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs International Journal of Production Economics 119 2009 367 379
2. A. Akbalik, and Y. Pochet Valid inequalities for the single-item capacitated lot sizing problem with stepwise costs European Journal of Operational Research 198 2009 412 434
3. O. Alp, N. Erkip, and R. Gullu Optimal lot sizing/vehicle dispatching policies under stochastic lead times and stepwise fixed costs Operations Research 51 2003 160 166
4. K.R. Baker, P. Dixon, M.J. Magazine, and E.A. Silver An algorithm for the dynamic lot-size problem with time-varying production capacity constraints Management Science 24 16 1978 1710 1720 (Pubitemid 9444885)
5. G.R. Bitran, and H.H. Yanasse Computational complexity of the capacitated lot size problem Management Science 28 10 1982 1174 1186
6. M. Florian, and M. Klein Deterministic production planning with concave costs and capacity constraints Management Science 18 1 1971 12 20
7. M. Florian, J.K. Lenstra, and A.H.G. Rinnooy Kan Deterministic production planning: algorithms and complexity Management Science 26 7 1980 669 679 (Pubitemid 11442296)
8. C.-Y. Lee A solution to the multiple setup problem with dynamic demand IIE Transactions 21 3 1989 266 270
9. C.-Y. Lee, S. Çetinkaya, and W. Jaruphongsa A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse Operations Research 51 5 2003 735 747
10. C.-L. Li, V.N. Hsu, and W.-Q. Xiao Dynamic lot sizing with batch ordering and truckload discounts Operations Research 52 4 2004 639 654
11. S.A. Lippman Optimal inventory policy with multiple set-up costs Management Science 16 1 1969 118 138
12. A.S. Manne Programming of economic lot sizes Management Science 4 1958 115 135
13. A.S. Manne, and A.F. Veinott Optimal arbitrary increasing time paths of demand A.S. Manne, Investments for Capacity Expansion: Size, Location and Time Phasing 1967 MIT Press Cambridge, Massachusetts 178 190 Ch. 11
14. Y. Pochet, and L.A. Wolsey Lot-sizing with constant batches: formulation and valid inequalities Mathematics of Operations Research 18 4 1993 767 785
15. Y. Pochet, and L.A. Wolsey Production Planning by Mixed Integer Programming 2006 Springer
16. T 3) algorithm for the economic lot-sizing problem with constant capacities Management Science 42 1 1996 142 150 (Pubitemid 126545091)
17. M. Van Vyve Algorithms for single-item lot-sizing problems with constant batch size Mathematics of Operations Research 32 3 2007 594 613 (Pubitemid 351159472)
18. H.M. Wagner, and T.M. Whitin Dynamic version of the economic lot size model Management Science 5 1 1958 89 96