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 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.
Similar content being viewed by others
References
Absi N and Kedad-Sidhoum S (2007). MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs. RAIRO Oper Res 41: 171–192
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–190
Absi N and Kedad-Sidhoum S (2008). The multi-item capacitated lot-sizing problem with setup times and shortage costs. Eur J Oper Res 185: 1351–1374
Chen WH and Thizy JM (1990). Analysis of relaxations for the multi-item capacitated lot-sizing problem. Ann Oper Res 26: 29–72
Marchand H and Wolsey LA (1999). The 0-1 knapsack problem with a single continuous variable. Math Program 85: 15–33
Miller AJ, Nemhauser GL and Savelsbergh MWP (2003). On the polyhedral structure of a multi-item production planning model with setup times. Math Program 94: 375–405
Trigeiro W, Thomas LJ and McLain JO (1989). Capacitated lot-sizing with setup times. Manage Sci 35: 353–366
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was financed by the ANRT and DynaSys S.A.
Rights and permissions
About this article
Cite this article
Absi, N. Models and methods for capacitated lot-sizing problems. 4OR 6, 311–314 (2008). https://doi.org/10.1007/s10288-007-0062-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-007-0062-4
keywords
- Production planning
- Lot-sizing
- Valid inequalities
- Dynamic programming
- Lagrangean relaxation
- Heuristic
- Branch-and-cut