N. Absi, Modélisation et résolution deprobì emes de lot-sizingàsizingà capacité finie, 2005.

N. Absi and S. Kedad-sidhoum, Multi-item capacitated lot-sizing problem with setup times and shortage costs. Working paper, Available at http://www.optimization-online.org, 2005.
DOI : 10.1016/j.ejor.2006.01.053

URL : https://hal.archives-ouvertes.fr/hal-00506261

D. Aksen, K. Altinkemer, and S. Chand, The single-item lot-sizing problem with immediate lost sales, European Journal of Operational Research, vol.147, issue.3, pp.558-566, 2003.
DOI : 10.1016/S0377-2217(02)00331-4

G. Belvaux and L. A. Wolsey, bc ??? prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems, Management Science, vol.46, issue.5, pp.724-738, 2000.
DOI : 10.1287/mnsc.46.5.724.12048

G. Bitran and H. H. Yanasse, Computational Complexity of the Capacitated Lot Size Problem, Management Science, vol.28, issue.10, pp.1174-1186, 1982.
DOI : 10.1287/mnsc.28.10.1174

N. Brahimi, S. Dauzère-pérès, N. M. Najid, and A. Nordli, Single item lot sizing problems, European Journal of Operational Research, vol.168, issue.1, pp.1-16, 2006.
DOI : 10.1016/j.ejor.2004.01.054

URL : https://hal.archives-ouvertes.fr/hal-00468355

W. H. Chen and J. M. Thizy, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Annals of Operations Research, vol.15, issue.9, pp.26-29, 1990.
DOI : 10.1007/BF02248584

A. R. Clark, Hybrid heuristics for planning lot setups and sizes, Computers & Industrial Engineering, vol.45, issue.4, pp.545-562, 2003.
DOI : 10.1016/S0360-8352(03)00073-1

M. Diaby, H. C. Bahl, M. H. Karwan, and S. Zionts, Capacitated lot-sizing and scheduling by Lagrangean relaxation, European Journal of Operational Research, vol.59, issue.3, pp.59-444, 1992.
DOI : 10.1016/0377-2217(92)90201-J

J. R. Evans, An efficient implementation of the Wagner-Whitin algorithm for dynamic lot-sizing, Journal of Operations Management, vol.5, issue.2, pp.229-235, 1982.
DOI : 10.1016/0272-6963(85)90009-9

M. Florian, J. K. Lenstra, and A. H. Kan, Deterministic Production Planning: Algorithms and Complexity, Management Science, vol.26, issue.7, pp.669-679, 1980.
DOI : 10.1287/mnsc.26.7.669

J. D. Kelly, Chronological decomposition heuristic for scheduling: Divide and conquer method, AIChE Journal, vol.20, issue.12, pp.2995-2999, 2002.
DOI : 10.1002/aic.690481226

J. Krarup and O. Bilde, Plant location, set covering and economic lot sizes: An o(mn)algorithm for structured problems, in optimierung bei graphentheoretischen and ganzzahligen probleme, pp.155-180, 1977.

J. M. Leung, T. L. Magnanti, and R. Vachani, Facets and algorithms for capacitated lot sizing, Mathematical Programming, vol.15, issue.1-3, pp.331-359, 1989.
DOI : 10.1007/BF01589110

. Cplex-callable and . Library, Ilog sa, 2005.

M. Loparic, Y. Pochet, and L. A. Wolsey, The uncapacitated lot-sizing problem with sales and safety stocks, Mathematical Programming, vol.89, issue.3, pp.487-504, 2001.
DOI : 10.1007/PL00011411

C. Mercé and G. Fontan, MIP-based heuristics for capacitated lotsizing problems, International Journal of Production Economics, vol.85, issue.1, pp.97-111, 2003.
DOI : 10.1016/S0925-5273(03)00090-2

A. J. Miller, Polyhedral Approaches to Capacitated Lot-Sizing Problems, 1999.

A. J. Miller, G. L. Nemhauser, and M. W. Savelsbergh, On the polyhedral structure of a multi-item production planning model with setup times, Mathematical Programming, vol.94, issue.2-3, pp.94-375, 2003.
DOI : 10.1007/s10107-002-0325-y

URL : https://hal.archives-ouvertes.fr/hal-00387113

Y. Pochet and L. A. Wolsey, Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes, Management Science, vol.37, issue.1, pp.53-67, 1991.
DOI : 10.1287/mnsc.37.1.53

R. Roundy, Efficient, effective lot-sizing for multi-product, multi-stage production systems, Oper. Res, pp.41-371, 1993.

R. A. Sandbothe and G. L. Thompson, A Forward Algorithm for the Capacitated Lot Size Model with Stockouts, Operations Research, vol.38, issue.3, pp.38-474, 1990.
DOI : 10.1287/opre.38.3.474

H. Stadtler, Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows, Operations Research, vol.51, issue.3, pp.487-502, 2003.
DOI : 10.1287/opre.51.3.487.14949

C. Suerie and H. Stadtler, The Capacitated Lot-Sizing Problem with Linked Lot Sizes, Management Science, vol.49, issue.8, pp.1039-1054, 2003.
DOI : 10.1287/mnsc.49.8.1039.16406

W. Trigeiro, L. J. Thomas, and J. O. Mclain, Capacitated Lot Sizing with Setup Times, Management Science, vol.35, issue.3, pp.353-366, 1989.
DOI : 10.1287/mnsc.35.3.353

M. Van-vyve and Y. Pochet, A general heuristic for production planning problems, IN- FORMS J. Comput, vol.16, pp.316-327, 2004.