首页 | 本学科首页   官方微博 | 高级检索  
     


Models and methods for capacitated lot-sizing problems
Authors:Nabil Absi
Affiliation:(1) Centre Microélectronique de Provence, école des Mines de Saint-étienne, Site Georges Charpak, Avenue des Anémones, Quartier Saint-Pierre, 13541 Gardanne, France
Abstract: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 . 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. This work was financed by the ANRT and DynaSys S.A.
Keywords:Production planning  Lot-sizing  Valid inequalities  Dynamic programming  Lagrangean relaxation  Heuristic  Branch-and-cut
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号