Volume 41, Number 2, April-June 2007ROADEF 05
|Page(s)||171 - 192|
|Published online||15 June 2007|
MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
Laboratoire LIP6, 4 place Jussieu, 75 252 Paris Cedex 05, France
2 Dynasys S.A., 10 Avenue Pierre Mendes France, 67 300 Schiltigheim, France ; Safia.Kedad-Sidhoum@lip6.fr
Accepted: 12 May 2006
We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons over which a freezing or a relaxation strategy is applied. Some experimental results showing the effectiveness of the approach on real-world instances are presented. A sensitivity analysis on the parameters of the heuristics is reported.
Mathematics Subject Classification: 90B30 / 90C59
Key words: Lot-sizing / setup time / shortage cost / safety stock deficit / production planning / mixed integer programming / heuristic
© EDP Sciences, ROADEF, SMAI, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.