LIP6 2005/009

• Reports
  Approche polyédrale pour un problème de lot-sizing à capacité finie avec temps de setup et coûts de ruptures.
• N. Absi, S. Kedad-Sidhoum
• 13 pages - 07/20/2005- document en - http://www.lip6.fr/lip6/reports/2005/lip6-2005-009.pdf - 150 Ko
• Contact : Safia.Kedad-Sidhoum (at) nulllip6.fr, Nabil.Absi (at) nulllip6.fr
• Ancien Thème : SYSDEF
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 can be modelled as a mixed integer program and it is NP-hard. In this paper, we propose some classes of valid inequalities based on a generalization of Miller et al. (2003) results. We study the polyhedral structure of the convex hull of this model which help us to prove that these inequalities induce facets of the convex hull under certain conditions.
Commentaires : Merci de me transmettre 5 rapports recherche.
• Keywords : Multi-item, capacitated lot-sizing, Setup times, shortage costs, Production planning, Mixed integer programming, Branch-and-cut
• Publisher : Thierry.Lanfroy (at) nulllip6.fr