Models and methods for capacitated lot-sizing problems
- 133 Downloads
This is a summary of the author’s PhD thesis supervised by Philippe Chrétienne and Safia Kedad-Sidhoum and defended in December 2005 at the Université Pierre et Marie Curie (Paris VI). The thesis is written in French and is available from http://absi.nabil.free.fr/ABSI-Thesis.pdf. This work mainly deals with multi-item capacitated lot-sizing problems with setup times, shortages on demand and safety stock deficit costs. We propose a new mathematical model that includes these new constraints. Three solution approaches are considered: branch-and-cut, Lagrangean relaxation and MIP-based heuristics approaches. Experimental results showing the effectiveness and the limit of each approach are presented.
keywordsProduction planning Lot-sizing Valid inequalities Dynamic programming Lagrangean relaxation Heuristic Branch-and-cut
MSC classification90B30 90C59 90C11 90C27 90C39 90C57
Unable to display preview. Download preview PDF.
- 2.Absi N, Kedad-Sidhoum S (2006) Capacitated lot-sizing problem with setup times, stock and demand shortages. NCOM’2006, 12th IFAC Symposium on Information Control Problems in Manufacturing, vol III, Operational Research, pp 185–190Google Scholar