Strong Formulations for Multi-Item Capacitated Lot Sizing, Management Science, vol.30, issue.10, pp.1255-1261, 1984. ,
DOI : 10.1287/mnsc.30.10.1255
Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs, Management Science, vol.47, issue.7, pp.993-1007, 2001. ,
DOI : 10.1287/mnsc.47.7.993.9800
URL : http://hdl.handle.net/2078.1/4098
Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, OR Spectrum, vol.13, issue.2, pp.231-261, 2010. ,
DOI : 10.1007/s00291-008-0150-7
Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs, Computers & Operations Research, vol.32, issue.11, pp.2987-3005, 2005. ,
DOI : 10.1016/j.cor.2004.04.012
Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition, Operations Research, vol.35, issue.6, pp.832-848, 1987. ,
DOI : 10.1287/opre.35.6.832
Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production, International Journal of Production Economics, vol.136, issue.2, pp.255-265, 2012. ,
DOI : 10.1016/j.ijpe.2011.11.028
The discrete lot-sizing and scheduling problem, European Journal of Operational Research, vol.44, issue.3, pp.337-348, 1990. ,
DOI : 10.1016/0377-2217(90)90245-7
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times, Operations Research Letters, vol.37, issue.1, pp.32-36, 2009. ,
DOI : 10.1016/j.orl.2008.10.001
Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources, International Journal of Production Research, vol.19, issue.9, pp.2587-2603, 2011. ,
DOI : 10.1287/mnsc.48.12.1587.442
URL : https://hal.archives-ouvertes.fr/hal-01264958
Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches, European Journal of Operational Research, vol.177, issue.3, pp.1855-1875, 2007. ,
DOI : 10.1016/j.ejor.2005.12.008
Modeling industrial lot sizing problems: a review, International Journal of Production Research, vol.34, issue.6, pp.1619-1643, 2008. ,
DOI : 10.1287/opre.45.6.894
URL : https://hal.archives-ouvertes.fr/hal-00512940
An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, p.291307, 1970. ,
DOI : 10.1002/j.1538-7305.1970.tb01770.x
Facets and algorithms for capacitated lot sizing, Mathematical Programming, pp.331-359, 1989. ,
DOI : 10.1007/BF01589110
On the capacitated lot-sizing and continuous 0???1 knapsack polyhedra, European Journal of Operational Research, vol.125, issue.2, pp.298-315, 2000. ,
DOI : 10.1016/S0377-2217(99)00461-0
URL : https://hal.archives-ouvertes.fr/hal-00387119
Production planning by mixed integer programming, 2006. ,
Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows, European Journal of Operational Research, vol.100, issue.3, pp.494-513, 1997. ,
DOI : 10.1016/S0377-2217(96)00020-3
Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry, Computers & Industrial Engineering, vol.50, issue.1-2, pp.79-89, 2006. ,
DOI : 10.1016/j.cie.2006.01.001
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs, Operations Research Letters, vol.20, issue.1, pp.7-13, 1997. ,
DOI : 10.1016/S0167-6377(96)00043-0
Dynamic Version of the Economic Lot Size Model, Management Science, vol.5, issue.1, pp.89-96, 1958. ,
DOI : 10.1287/mnsc.5.1.89