Polynomial cases of the economic lot sizing problem with cost discounts

European Journal of Operational Research

Volumn 237, Issue 2, 2014, Pages 519-527

  Archetti, Claudia ^a   Bertazzi, Luca ^a   Grazia Speranza, M ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

Economic lot sizing problem with cost discounts; Incremental discount; Modified all unit discount; Piecewise linear; Polynomial time algorithms

Indexed keywords

ALGORITHMS; COST FUNCTIONS; PIECEWISE LINEAR TECHNIQUES; POLYNOMIALS;

INCREMENTAL DISCOUNT; LOT SIZING PROBLEMS; MODIFIED ALL-UNIT DISCOUNT; PIECEWISE LINEAR; POLYNOMIAL-TIME ALGORITHMS;

COSTS;

EID: 84899429342     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.02.044     Document Type: Article

References (26)

1. A. Aggarwal, and J.K. Park Improved algorithms for economic lot-size problems Operations Research 41 1993 549 571
2. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network flows 1993 Prentice Hall Englewood Cliffs
3. N. Brahimi, S. Dauzere-Peres, N.M. Najid, and A. Nordli Single item lot sizing problems European Journal of Operational Research 168 2006 1 16
4. L. Buschkühl, F. Sahling, S. Helber, and H. Tempelmeier Dynamic capacitated lot-sizing problems: A classification and review of solution approaches Or Spectrum 32 2010 231 261
5. L.M.A. Chan, A. Muriel, Z.-J. Shen, and D. Simchi-Levi On the effectiveness of zero-inventory ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures Operations Research 50 2002 1058 1067
6. L.M.A. Chan, A. Muriel, Z.-J. Shen, D. Simchi-Levi, and C.-P. Teo Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures Management Science 48 2002 1446 1460
7. S. Chopra, and P. Meindl Supply chain management 2010 Prentice Hall Upper Saddle River, NJ
8. K.L. Croxton, B. Gendron, and T.L. Magnanti A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems Management Science 49 2003 1268 1273
9. K.L. Croxton, B. Gendron, and T.L. Magnanti Models and methods for merge-in-transit operations Transportation Science 37 2003 1 22
10. A. Federgruen, and M. Tzur A simple forward algorithm to solve general dynamic lot sizing models with n periods in O (nlogn) or O (n) time Management Science 37 1991 909 925
11. M. Florian, and M. Klein Deterministic production planning with concave costs and capacity constraints Management Science 18 1971 12 20
12. B. Hellion, F. Mangione, and B. Penz A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs European Journal of Operational Research 222 2012 10 16
13. H.-C. Hwang Economic lot-sizing for integrated production and transportation Operations research 58 2010 428 444
14. S.D. Lapierre, A.B. Ruiz, and P. Soriano Designing distribution networks: Formulations and solution heuristic Transportation Science 38 2004 174 187
15. C.-L. Li, J. Ou, and V.N. Hsu Dynamic lot sizing with all-units discount and resales Naval Research Logistics 59 2012 230 243
16. J.A. Muckstadt, and A. Sapra Principles of inventory management: When you are down to four, order more Springer Series in Operations Research and Financial Engineering 2009
17. S. Nahmias Production and operations analysis 2001 McGraw-Hill Boston, MA
18. Y. Pochet, and L.A. Wolsey Lot-sising with constant batches: Formulation and valid inequalities Mathematics of Operations Research 18 1993 767 785
19. P. Robinson, A. Narayanan, and F. Sahin Coordinated deterministic dynamic demand lot-sizing problem: a review of models and algorithms Omega 37 2009 3 15
20. 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
21. D. Simchi-Levi, P. Kaminsky, and E. Simchi-Levi Designing & managing the supply chain 2007 McGraw-Hill
22. J.P. Vielma, S. Ahmed, and G. Nemhauser Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions Operations Research 58 2010 303 315
23. A. Wagelmans, S. van Hoesel, and A. Kolen Economic lot sizing-An O(nlogn) algorithm that runs in linear time in the Wagner-Whitin case Operations Research 40 1992 S145 S156
24. H.M. Wagner, and T.M. Whitin Dynamic version of the economic lot sizing model Management Science 5 1958 89 96
25. H.M. Wagner, and T.M. Whitin Dynamic version of the economic lot sizing model Management Science 50 2004 1770 1774
26. T.M. Whitin The theory of inventory management 1957 Princeton University Press Princeton, NJ