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

DOI10.1016/j.ejor.2013.01.051zbMath1317.90024OpenAlexW2013720966MaRDI QIDQ2355847

Fabien Mangione, Bertrand Hellion, Bernard Penz

Publication date: 28 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.01.051

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (5)

Lot Sizing with Piecewise Concave Production Costs ⋮ Improved algorithms for dynamic lot sizing problems with incremental discount ⋮ A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities ⋮ Improved exact algorithms to economic lot-sizing with piecewise linear production costs ⋮ A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows

This page was built for publication: Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs