The multi-item capacitated lot-sizing problem with setup times and shortage costs - Archive ouverte HAL Access content directly
Journal Articles European Journal of Operational Research Year : 2008

The multi-item capacitated lot-sizing problem with setup times and shortage costs

Abstract

We address a multi-item capacitated lot-sizing problem with setup times and shortage costs that arises in real-world production planning problems. Demand cannot be backlogged, but can be totally or partially lost. The problem is NP-hard. A mixed integer mathematical formulation is presented. Our approach in this paper is to propose some classes of valid inequalities based on a generalization of Miller et al. [A.J. Miller, G.L. Nemhauser, M.W.P. Savelsbergh, On the polyhedral structure of a multi-item production planning model with setup times, Mathematical Programming 94 (2003) 375–405] and Marchand and Wolsey [H. Marchand, L.A. Wolsey, The 0–1 knapsack problem with a single continuous variable, Mathematical Programming 85 (1999) 15–33] results. We also describe fast combinatorial separation algorithms for these new inequalities. We use them in a branch-and-cut framework to solve the problem. Some experimental results showing the effectiveness of the approach are reported.
Fichier principal
Vignette du fichier
ABSI-EJOR2008.pdf (284.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00506261 , version 1 (27-07-2010)

Identifiers

Cite

Nabil Absi, Safia Kedad-Sidhoum. The multi-item capacitated lot-sizing problem with setup times and shortage costs. European Journal of Operational Research, 2008, 185 (3), pp.1351-1374. ⟨10.1016/j.ejor.2006.01.053⟩. ⟨hal-00506261⟩
280 View
726 Download

Altmetric

Share

Gmail Facebook X LinkedIn More