MIP-based heuristics for 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 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.
Type de document :
Article dans une revue
RAIRO - Operations Research, EDP Sciences, 2007, 41 (2), pp.171-192. 〈10.1051/ro:2007014〉
Liste complète des métadonnées

Littérature citée [26 références]  Voir  Masquer  Télécharger

https://hal-emse.ccsd.cnrs.fr/emse-01182232
Contributeur : Nabil Absi <>
Soumis le : lundi 3 août 2015 - 11:07:13
Dernière modification le : mercredi 21 mars 2018 - 18:58:11

Identifiants

Collections

EMSE | UPMC | LIP6

Citation

Nabil Absi, Safia Kedad-Sidhoum. MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs. RAIRO - Operations Research, EDP Sciences, 2007, 41 (2), pp.171-192. 〈10.1051/ro:2007014〉. 〈emse-01182232〉

Partager

Métriques

Consultations de la notice

99