A stochastic multi-item lot-sizing problem with bounded number of setups - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

A stochastic multi-item lot-sizing problem with bounded number of setups

Résumé

Within a partnership with a consulting company, we address a production problem modeled as a stochastic multi-item lot-sizing problem with bounded numbers of setups per period and without setup cost. While this formulation seems to be rather non-standard in the lot-sizing landscape, it is motivated by concrete missions of the company. Since the deterministic version of the problem is NP-hard and its full stochastic version clearly intractable, we turn to approximate methods and propose a repeated two-stage stochastic programming approach to solve it. Using simulations on real-world instances, we show that our method gives better results than current heuristics used in industry. Moreover, our method provides lower bounds proving the quality of the approach. Since the computational times are small and the method easy to use, our contribution constitutes a promising response to the original industrial problem.
Fichier principal
Vignette du fichier
2018-01_ICORES_paper.pdf (173.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01586497 , version 1 (12-09-2017)
hal-01586497 , version 2 (04-11-2017)

Identifiants

  • HAL Id : hal-01586497 , version 2

Citer

Etienne de Saint Germain, Vincent Leclère, Frédéric Meunier. A stochastic multi-item lot-sizing problem with bounded number of setups. 2017. ⟨hal-01586497v2⟩
135 Consultations
261 Téléchargements

Partager

Gmail Facebook X LinkedIn More