Lot Sizing with Piecewise Concave Production Costs

References

• Archetti C, Bertazzi L, Speranza MG (2011) Polynomial cases of the economic lot sizing problem with quantity discounts. Technical report, Department of Quantitative Methods, University of Brescia, Brescia, Italy.Google Scholar
• Atamtürk A, Hochbaum DS (2001) Capacity acquisition, subcontracting, and lot sizing. Management Sci. 47:1081–1100.Link, Google Scholar
• Chan LMA, Muriel A, Shen Z-J, Simchi-Levi D (2002) On the effectiveness of zero-inventory-ordering policies for economic lot sizing model with a class of piecewise linear cost structures. Oper. Res. 50:1058–1067.Link, Google Scholar
• Croxton KL, Gendron B, Magnanti TL (2003) A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Sci. 49:1268–1273.Link, Google Scholar
• Federgruen A, Lee C-Y (1990) The dynamic lot size model with quantity discount. Naval Res. Logist. 37:707–713.Crossref, Google Scholar
• Florian M, Klein M (1971) Deterministic production planning with concave costs and capacity constraints. Management Sci. 18:12–20.Link, Google Scholar
• Hellion B, Mangione F, Penz B (2012) A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs. Eur. J. Oper. Res. 222:10–16.Crossref, Google Scholar
• Hellion B, Mangione F, Penz B (2013) Corrigendum to “a polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs.” Eur. J. Oper. Res. 229:279.Crossref, Google Scholar
• Li C-L, Ou J, Hsu VN (2012) Dynamic lot sizing with all-units discount and resales. Naval Res. Logist. 59:230–243.Crossref, Google Scholar
• Okhrin I, Richter K (2011) An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities. Eur. J. Oper. Res. 211:507–514.Crossref, Google Scholar
• Pochet Y, Wolsey LA (2006) Production Planning by Mixed Integer Programming (Springer, New York).Google Scholar
• Sanjeevi S, Kianfar K (2012) Mixed n-step MIR inequalities: Facets for the n-mixing set. Discrete Optim. 9:216–235.Crossref, Google Scholar
• Shaw DX, Wagelmans APM (1998) An algorithm for single-item capacitated economic lot-sizing problem with piecewise linear production costs and general holding costs. Management Sci. 44:831–838.Link, Google Scholar
• Swoveland C (1975) A deterministic multi-period production planning model with piecewise concave production and holding-backorder costs. Management Sci. 21:1007–1013.Link, Google Scholar
• VanHoesel CPM, Wagelmans APM (1996) An O(T3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. 42:142–150.Link, Google Scholar
• Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Management Sci. 5:89–96.Link, Google Scholar
• Zangwill IW (1966) A deterministic multi-period production scheduling model with backlogging. Management Sci. 13:105–119.Link, Google Scholar
• Zangwill IW (1967) The piecewise concave function. Management Sci. 13:900–912.Link, Google Scholar