Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory

Abstract : We consider a two-level dynamic lot-sizing problem where the first level consists of N finished products competing for a single type of purchased raw material in the second level. While the procurement and production capacities are unlimited, the storage capacity of the raw material is limited and must be carefully managed. The goal is to simultaneously determine a replenishment plan for the raw material and optimal production plans for the finished products on a horizon of T periods while minimizing production, purchasing, setup and inventory holding costs. The problem is modeled using mixed-integer linear programs and solved using both a Lagrangian relaxation-based heuristic and a commercial mixed-integer linear programming solver. 123 N. Brahimi et al. Learning capabilities are integrated in the Lagrangian relaxation to update step size in the subgradient algorithm. The computational results show that the Lagrangian heuris-tic outperforms the solver on different formulations, in particular for large problems with long time horizons.
Type de document :
Article dans une revue
OR Spectrum, Springer Verlag, 2015, 37 (4), pp.983-1006. 〈10.1007/s00291-015-0404-0〉
Liste complète des métadonnées

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

https://hal-emse.ccsd.cnrs.fr/emse-01181851
Contributeur : Nabil Absi <>
Soumis le : jeudi 30 juillet 2015 - 17:35:24
Dernière modification le : mercredi 21 mars 2018 - 18:58:11

Identifiants

Collections

Citation

Nadjib Brahimi, Nabil Absi, Stéphane Dauzère-Pérès, Safia Kedad-Sidhoum. Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory. OR Spectrum, Springer Verlag, 2015, 37 (4), pp.983-1006. 〈10.1007/s00291-015-0404-0〉. 〈emse-01181851〉

Partager

Métriques

Consultations de la notice

208