Effective replenishment policies for the multi-item dynamic lot-sizing problem with inventory limited
Date:
July 11-14, 2010. Co-authored with Gutiérrez J, Abdul-Jalbar B and Sicilia J. Technical Sessions, page 247.
Abstract
We address the dynamic lot-sizing problem considering multiple items and storage capacity. Despite we can easily characterize a subset of optimal solutions just extending the properties of the single-item case, these results are not helpful to design an efficient algorithm. Accordingly, heuristics are appropriate approaches to obtain near-optimal solutions for this NP-hard problem. Thus, we propose a heuristic procedure based on the smoothing technique, which is tested on a large set of randomly generated instances.