K. Aardal and T. Larsson, A benders decomposition based heuristic for the hierarchical production planning problem, European Journal of Operational Research, vol.45, issue.1, pp.4-14, 1990.
DOI : 10.1016/0377-2217(90)90151-Z

E. H. Aarts, M. F. Reijnhoudt, H. P. Stehouwer, and J. Wessels, A novel decomposition approach for on-line lot-sizing, European Journal of Operational Research, vol.122, issue.2, pp.339-353, 2000.
DOI : 10.1016/S0377-2217(99)00237-4

N. Absi, S. Dauzère-pérès, S. Kedad-sidhoum, B. Penz, R. et al., Lot sizing with carbon emission constraints, European Journal of Operational Research, vol.227, issue.1, 2012.
DOI : 10.1016/j.ejor.2012.11.044
URL : https://hal.archives-ouvertes.fr/hal-00764867

N. Absi and S. Kedad-sidhoum, The multi-item capacitated lot-sizing problem with setup times and shortage costs, European Journal of Operational Research, vol.185, issue.3, pp.1351-1374, 2008.
DOI : 10.1016/j.ejor.2006.01.053
URL : https://hal.archives-ouvertes.fr/hal-00506261

N. Absi, S. Kedad-sidhoum, and S. Dauzère-pérès, Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales, International Journal of Production Research, vol.47, issue.9, pp.2551-2566, 2011.
DOI : 10.1287/mnsc.15.9.506
URL : https://hal.archives-ouvertes.fr/emse-00613024

J. Adams, E. Balas, and D. Zawack, The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science, vol.34, issue.3, pp.391-401, 1988.
DOI : 10.1287/mnsc.34.3.391

P. Afentakis and B. Gavish, Optimal Lot-Sizing Algorithms for Complex Product Structures, Operations Research, vol.34, issue.2, pp.237-249, 1986.
DOI : 10.1287/opre.34.2.237

P. Afentakis, B. Gavish, and U. S. Karmarkar, Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems, Management Science, vol.30, issue.2, pp.222-240, 1984.
DOI : 10.1287/mnsc.30.2.222

A. Aggarwal and J. K. Park, Improved Algorithms for Economic Lot Size Problems, Operations Research, vol.41, issue.3, pp.549-571, 1993.
DOI : 10.1287/opre.41.3.549

R. Aggoune, Minimizing the makespan for the flow shop scheduling problem with availability constraints, European Journal of Operational Research, vol.153, issue.3, pp.534-543, 2004.
DOI : 10.1016/S0377-2217(03)00261-3
URL : https://hal.archives-ouvertes.fr/inria-00099940

R. Aggoune, S. Dauzère-pérès, C. Wolosewicz, G. Urrutia, and E. D. , A solution procedure for an integrated lot-sizing and scheduling problem, 2011.
URL : https://hal.archives-ouvertes.fr/emse-00693467

R. Aggoune and M. Portmann, Flow shop scheduling problem with limited machine availability: A heuristic approach, International Journal of Production Economics, vol.99, issue.1-2, pp.1-2, 2006.
DOI : 10.1016/j.ijpe.2004.12.002
URL : https://hal.archives-ouvertes.fr/inria-00099826

N. Aissaoui, M. Haouari, and E. Hassin, Supplier selection and order lot sizing modeling: A review, Computers & Operations Research, vol.34, issue.12, pp.3516-3540, 2007.
DOI : 10.1016/j.cor.2006.01.016

K. Akartunal? and A. J. Miller, A heuristic approach for big bucket multi-level production planning problems, European Journal of Operational Research, vol.193, issue.2, pp.396-411, 2009.
DOI : 10.1016/j.ejor.2007.11.033

A. Allahverdi, C. T. Ng, T. C. Cheng, and M. Y. Kovalyov, A survey of scheduling problems with setup times or costs, European Journal of Operational Research, vol.187, issue.3, pp.985-1032, 2008.
DOI : 10.1016/j.ejor.2006.06.060

B. Almada-lobo, J. , and R. J. , Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups, International Journal of Production Research, vol.32, issue.3, pp.861-878, 2010.
DOI : 10.1287/mnsc.44.10.1409

B. Almada-lobo, D. Klabjan, M. A. Carravilla, and J. Oliveira, Single machine multi-product capacitated lot sizing with sequence-dependent setups, International Journal of Production Research, vol.45, issue.20, pp.4873-4894, 2007.
DOI : 10.1287/mnsc.35.3.353

B. Almada-lobo, D. Klabjan, M. A. Carravilla, and J. Oliveira, Multiple machine continuous setup lotsizing with??sequence-dependent setups, Computational Optimization and Applications, vol.99, issue.3, pp.529-552, 2010.
DOI : 10.1007/s10589-009-9235-8

B. Almada-lobo, J. F. Oliveira, A. Carravilla, and M. , A note on ???the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Computers & Operations Research, vol.35, issue.4, pp.1374-1376, 2008.
DOI : 10.1016/j.cor.2006.08.019

B. Almada-lobo, J. F. Oliveira, and M. A. Carravilla, Production planning and scheduling in the glass container industry: A VNS approach, International Journal of Production Economics, vol.114, issue.1, pp.363-375, 2008.
DOI : 10.1016/j.ijpe.2007.02.052

C. Almeder, A hybrid optimization approach for multi-level capacitated lot-sizing problems, European Journal of Operational Research, vol.200, issue.2, pp.599-606, 2010.
DOI : 10.1016/j.ejor.2009.01.019

P. Amorim, T. Pinto-varela, B. Almada-lobo, and A. Barbósa-póvoa, Comparing models for lot-sizing and scheduling of single-stage continuous processes: Operations research and process systems engineering approaches, Computers & Chemical Engineering, vol.52, pp.177-192, 2013.
DOI : 10.1016/j.compchemeng.2013.01.006

D. L. Applegate, R. E. Va?ek-chvátal, and W. J. Cook, The Traveling Salesman Problem : A Computational Study, 2006.

S. A. Araujo, M. N. Arenales, C. , and A. R. , Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups, Journal of Heuristics, vol.48, issue.1, pp.337-358, 2007.
DOI : 10.1007/s10732-007-9011-9

C. Artigues and D. Feillet, A branch and bound method for the job-shop problem with sequence-dependent setup times, Annals of Operations Research, vol.5, issue.4, pp.135-159, 2007.
DOI : 10.1007/s10479-007-0283-0
URL : https://hal.archives-ouvertes.fr/hal-00103387

C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. Savelsbergh, and P. H. Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.
DOI : 10.1287/opre.46.3.316

J. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, vol.38, issue.1, pp.238-252, 1962.
DOI : 10.1007/BF01386316

S. Benjaafar, Y. Li, and M. Daskin, Carbon Footprint and the Management of Supply Chains: Insights From Simple Models, IEEE Transactions on Automation Science and Engineering, vol.10, issue.1, 2010.
DOI : 10.1109/TASE.2012.2203304

R. Berretta, P. M. França, and V. A. Armentano, METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES, Asia-Pacific Journal of Operational Research, vol.22, issue.02
DOI : 10.1142/S0217595905000510

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

F. F. Boctor and P. Poulin, -stage, economic lot sizing and scheduling problem with dynamic demand, International Journal of Production Research, vol.15, issue.13, pp.2809-2828, 2005.
DOI : 10.1287/mnsc.5.1.89
URL : https://hal.archives-ouvertes.fr/hal-01146319

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. Brüggemann, J. , and H. , The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability, European Journal of Operational Research, vol.124, issue.3, pp.511-528, 2000.
DOI : 10.1016/S0377-2217(99)00190-3

M. J. Brusco and S. Stahl, Branch-and-Bound Applications in Combinatorial Data Analysis, 2005.

L. Buschkühl, F. Sahling, S. Helber, and H. Tempelmeier, 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

H. Chen, C. Chu, and J. M. Proth, A more efficient Lagrangian relaxation approach to job-shop scheduling problems, IEEE International Conference on Robotics and Automation, pp.496-501, 1995.

A. J. Clark and H. Scarf, Optimal Policies for a Multi-Echelon Inventory Problem, Management Science, vol.6, issue.4, pp.475-490, 1960.
DOI : 10.1287/mnsc.6.4.475

A. R. Clark and V. A. Armentano, Echelon stock formulation for multi-stage lot-sizing with component lead times, International Journal of Systems Science, vol.24, issue.9, pp.1759-1775, 1993.
DOI : 10.1287/mnsc.5.1.89

A. R. Clark and V. A. Armentano, A Heuristic for a Resource-capacitated Multi-stage Lot-sizing Problem with Lead Times, Journal of the Operational Research Society, vol.46, issue.10, pp.1208-1222, 1995.
DOI : 10.1057/jors.1995.169

M. Constantino, A polyhedral approach to a production planning problem, Annals of Operations Research, vol.96, pp.1-4, 2000.

J. J. Coyle, C. J. Langley, B. J. Gibson, R. A. Novack, and E. J. Bardi, Supply Chain Management : A Logistics Perspective, 2009.

H. A. Crauwels, C. N. Potts, V. Wassenhove, and L. N. , Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time, Annals of Operations Research, vol.70, pp.261-279, 1997.
DOI : 10.1023/A:1018978322417

G. B. Dantzig and P. Wolfe, Decomposition Principle for Linear Programs, Operations Research, vol.8, issue.1, pp.101-111, 1960.
DOI : 10.1287/opre.8.1.101

S. Dauzère-pérès and J. Lasserre, A modified shifting bottleneck procedure for job-shop scheduling, International Journal of Production Research, vol.31, issue.4, pp.923-932, 1993.
DOI : 10.1287/opre.28.6.1436

S. Dauzère-pérès and J. Lasserre, Integration of lotsizing and scheduling decisions in a job-shop, European Journal of Operational Research, vol.75, issue.2, pp.413-426, 1994.
DOI : 10.1016/0377-2217(94)90085-X

S. Dauzère-pérès and J. Lasserre, On the importance of sequencing decisions in production planning and scheduling, International Transactions in Operational Research, vol.9, issue.6, pp.779-793, 2002.
DOI : 10.1111/1475-3995.00388

S. Dauzère-pérès and J. Paulli, An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search, Annals of Operations Research, vol.70, pp.0-281, 1997.

R. De-matta and M. Guignard, The performance of rolling production schedules in a process industry, IIE Transactions, vol.5, issue.5, pp.564-573, 1995.
DOI : 10.1287/opre.39.1.56

L. A. De-santa-eulalia, S. D-'amours, J. Frayret, C. C. Menegusso, C. Azevedo et al., Advanced Supply Chain Planning Systems (APS) Today and Tomorrow, Supply Chain Management -Pathways for Research and Practice, D. Onkal, pp.171-200, 2011.
DOI : 10.5772/19098

Z. Degraeve, J. , and R. , A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times, Operations Research, vol.55, issue.5, pp.909-920, 2007.
DOI : 10.1287/opre.1070.0404

D. Croce, F. Ghirardi, M. Tadei, and R. , An improved branch-and-bound algorithm for the two machine total completion time flow shop problem, European Journal of Operational Research, vol.139, issue.2, pp.293-301, 2002.
DOI : 10.1016/S0377-2217(01)00374-5

G. Desaulniers, J. Desrosiers, and M. M. Solomon, Column Generation, 2010.
DOI : 10.1007/b135457

M. Diaby, H. C. Bahl, M. H. Karwan, and S. Zionts, A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing, Management Science, vol.38, issue.9, pp.1329-1340, 1992.
DOI : 10.1287/mnsc.38.9.1329

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.448-458, 1992.
DOI : 10.1016/0377-2217(92)90201-J

J. P. Dittmann, Supply Chain Transformation : Building and Executing an Integrated Supply Chain Strategy, 2012.

M. Dorigo and T. Stützle, Ant Colony Optimization, 2004.

J. Dréo, P. Siarry, A. Pétrowsky, and E. Taillard, Metaheuristics for Hard Optimization : Methods and Case Studies, 2005.

A. Drexl and K. Haase, Proportional lotsizing and scheduling, International Journal of Production Economics, vol.40, issue.1, pp.73-87, 1995.
DOI : 10.1016/0925-5273(95)00040-U

A. Drexl and A. Kimms, Lot sizing and scheduling ??? Survey and extensions, European Journal of Operational Research, vol.99, issue.2, pp.221-235, 1997.
DOI : 10.1016/S0377-2217(97)00030-1

D. Du and K. Ko, Theory of Computational Complexity, 2000.

G. Dueck and T. Scheuer, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, Journal of Computational Physics, vol.90, issue.1, pp.161-175, 1990.
DOI : 10.1016/0021-9991(90)90201-B

G. Fandel and C. Stammen-hegene, Simultaneous lot sizing and scheduling for multi-product multi-level production, International Journal of Production Economics, vol.104, issue.2, pp.308-316, 2006.
DOI : 10.1016/j.ijpe.2005.04.011

A. Federgruen and M. Tzur, A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time, Management Science, vol.37, issue.8, pp.909-925, 1991.
DOI : 10.1287/mnsc.37.8.909

T. A. Feo, R. , and M. G. , Greedy Randomized Adaptive Search Procedures, Journal of Global Optimization, vol.68, issue.2, pp.109-134, 1995.
DOI : 10.1007/BF01096763

D. Ferreira, A. R. Clark, B. Almada-lobo, and R. Morabito, 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

D. Ferreira, R. Morabito, and S. Rangel, Solution approaches for the soft drink integrated production lot sizing and scheduling problem, European Journal of Operational Research, vol.196, issue.2, pp.697-706, 2009.
DOI : 10.1016/j.ejor.2008.03.035

M. L. Fisher, The Lagrangian Relaxation Method for Solving Integer Programming Problems, Management Science, vol.27, issue.1, pp.1-18, 1981.
DOI : 10.1287/mnsc.27.1.1

B. Fleischmann, 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

B. Fleischmann and H. Meyr, The general lotsizing and scheduling problem, Operations-Research-Spektrum, vol.17, issue.1, pp.11-21, 1997.
DOI : 10.1080/07408178508975308

B. Fleischmann and H. Meyr, Advanced planning, pp.81-109, 2008.

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

P. M. França, V. A. Armentano, R. E. Berretta, C. , and A. R. , A heuristic method for lot-sizing in multi-stage systems, Computers & Operations Research, vol.24, issue.9, pp.9-861, 1997.
DOI : 10.1016/S0305-0548(96)00097-4

L. F. Gelders, J. Maes, V. Wassenhove, and L. N. , A Branch and Bound Algorithm for the Multi Item Single Level Capacitated Dynamic Lotsizing Problem, Multi-Stage Production Planning and Inventory Control of Lecture Notes in Economics and Mathematical Systems, pp.92-108, 1986.
DOI : 10.1007/978-3-642-51693-1_5

P. Genin, S. Lamouri, and A. Thomas, Planification avancée : APS. Techniques de l'ingénieur Modes de pilotage des flux logistiques base documentaire : TIB121DUO., ref. article, pp.5120-5121, 2005.

C. Gicquel, N. Miègeville, M. Minoux, and Y. Dallery, Discrete lot sizing and scheduling using product decomposition into attributes, Computers & Operations Research, vol.36, issue.9, pp.2690-2698, 2009.
DOI : 10.1016/j.cor.2008.11.017
URL : https://hal.archives-ouvertes.fr/hal-01170200

C. Gicquel, M. Minoux, and Y. Dallery, 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

C. Gicquel, L. A. Wolsey, and M. Minoux, On discrete lot-sizing and scheduling on identical parallel machines, Optimization Letters, vol.75, issue.3, pp.545-557, 2011.
DOI : 10.1007/s11590-011-0280-8
URL : https://hal.archives-ouvertes.fr/hal-01170471

F. W. Glover, Future paths for integer programming and links to artificial intelligence, Computers & Operations Research, vol.13, issue.5, pp.533-549, 1986.
DOI : 10.1016/0305-0548(86)90048-1

F. W. Glover and M. Laguna, Tabu search, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01389283

G. Ravetti, M. Mateus, G. R. Rocha, P. L. , P. et al., A scheduling problem with unrelated parallel machines and sequence dependent setups, International Journal of Operational Research, vol.2, issue.4, pp.4-380, 2007.
DOI : 10.1504/IJOR.2007.014169

G. Urrutia, E. D. Aggoune, R. Dauzère-pérès, and S. , Improvements of an Integrated Approach for Lot Sizing and Detailed Scheduling, Proceedings of the 2nd International Workshop on Lot Sizing, 2011.
URL : https://hal.archives-ouvertes.fr/emse-00693445

G. Urrutia, E. D. Aggoune, R. Dauzère-pérès, and S. , An Integrated Approach for Solving Multi-Level Lot-Sizing and Scheduling Problems with Detailed Capacity Constraints, Proceedings of the 3rd International Workshop on Lot Sizing, pp.1-4

G. Urrutia, E. D. Aggoune, R. Dauzère-pérès, and S. , New integrated approach for solving multi-level lot sizing and scheduling problems, 9th International Conference of Modeling, Optimization and Simulation
URL : https://hal.archives-ouvertes.fr/hal-00728607

G. Urrutia, E. D. Aggoune, R. Dauzère-pérès, and S. , Nouvelle méthode intégrée pour résoudre le problème multi-niveaux de planification et d'ordonnancement, ROADEF2012 (Angers, 2012.

G. Urrutia, E. D. Aggoune, R. Dauzère-pérès, and S. , Analysis and Improvements of a Solving Procedure for the Integration of Lot-Sizing and Scheduling Decisions, Proceedings of the 5th International Conference on Industrial Engineering and Systems Management, p.8

G. Urrutia, E. D. Aggoune, R. Dauzère-pérès, and S. , Résolution d'un problème de planification et d'ordonnancement multi-niveaux dans un job-shop

G. Urrutia, E. D. Aggoune, R. Dauzère-pérès, and S. , Smoothing Procedures for an Integrated Approach for Multi Level Lot Sizing and Detailed Scheduling, Proceedings of the 4th International Workshop on Lot Sizing, p.4
URL : https://hal.archives-ouvertes.fr/emse-00998470

G. Urrutia, E. D. Aggoune, R. Dauzère-pérès, and S. , Solving the integrated lot-sizing and job-shop scheduling problem, International Journal of Production Research, 2014.
URL : https://hal.archives-ouvertes.fr/emse-01095727

G. Urrutia, E. D. Aggoune, R. Dauzère-pérès, S. Wolosewicz, and C. , An Integrated Approach for Lot Sizing and Detailed Scheduling in Job-Shops, Proceedings of the 4th International Conference on Information Systems, Logistics and Supply Chain
URL : https://hal.archives-ouvertes.fr/emse-00753701

M. Gopalakrishnan, K. Ding, J. Bourjolly, M. , and S. Tabu, A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover, Management Science, vol.47, issue.6, pp.851-863, 2001.
DOI : 10.1287/mnsc.47.6.851.9813

H. G. Goren, S. Tunali, J. , and R. , A hybrid approach for the capacitated lot sizing problem with setup carryover, International Journal of Production Research, vol.31, issue.2, pp.1582-1597, 2012.
DOI : 10.1016/S0898-1221(02)00146-3

I. E. Grossmann, S. A. Van-den-heever, and I. Harjunkoski, Discrete Optimization Methods and their Role in the Integration of Planning and Scheduling, AIChe Symposium Series, vol.326, pp.150-168, 2002.

Y. Guan, S. Ahmed, G. L. Nemhauser, and A. J. Miller, A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem, Mathematical Programming, vol.5, issue.1, pp.55-84, 2006.
DOI : 10.1007/s10107-005-0572-9
URL : https://hal.archives-ouvertes.fr/hal-00387116

M. Guignard, K. , and S. , Lagrangean decomposition: A model yielding stronger lagrangean bounds, Mathematical Programming, vol.28, issue.2, pp.215-228, 1987.
DOI : 10.1007/BF02612335

G. Goren, H. Tunali, S. , J. , and R. , A review of applications of genetic algorithms in lot sizing, Journal of Intelligent Manufacturing, vol.44, issue.1, pp.575-590, 2008.
DOI : 10.1007/s10845-008-0205-2

D. Gupta and T. Magnusson, The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Computers & Operations Research, vol.32, issue.4, pp.727-747, 2005.
DOI : 10.1016/j.cor.2003.08.014

K. Haase, Capacitated lot-sizing with sequence dependent setup costs, Operations-Research-Spektrum, vol.17, issue.1, pp.51-59, 1996.
DOI : 10.1080/07408178508975308

K. Haase, Capacitated Lot-Sizing with Linked Production Quantities of Adjacent Periods 1 Introduction, Beyond Manufacturing Resource Planning (MRP II, pp.127-146, 1998.

K. Haase and A. Kimms, Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities, International Journal of Production Economics, vol.66, issue.2, pp.159-169, 2000.
DOI : 10.1016/S0925-5273(99)00119-X

C. Haksöz and M. Pinedo, Economic lot scheduling with resources in parallel, International Journal of Production Research, vol.43, issue.9, pp.2625-2641, 2011.
DOI : 10.1080/00207540410001691901

P. Hansen and N. Mladenovi?, Variable neighborhood search: Principles and applications, European Journal of Operational Research, vol.130, issue.3, pp.449-467, 2001.
DOI : 10.1016/S0377-2217(00)00100-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.1769

P. Hansen, N. Mladenovi?, and D. Perez-brito, Variable Neighborhood Decomposition Search, Journal of Heuristics, vol.7, issue.4, pp.335-350, 2001.
DOI : 10.1023/A:1011336210885

A. M. Hariri and C. N. Potts, Single machine scheduling with batch set-up times to minimize maximum lateness, Annals of Operations Research, vol.70, pp.75-92, 1997.
DOI : 10.1023/A:1018903027868

F. W. Harris, How Many Parts to Make at Once, Operations Research, vol.38, issue.6, pp.947-950, 1990.
DOI : 10.1287/opre.38.6.947

P. E. Hart, N. J. Nilsson, R. , and B. , A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968.
DOI : 10.1109/TSSC.1968.300136

R. Haupt, A survey of priority rule-based scheduling, OR Spektrum, vol.18, issue.1, pp.3-16, 1989.
DOI : 10.1007/BF01721162

S. Helber and F. Sahling, A fix-and-optimize approach for the multi-level capacitated lot sizing problem, International Journal of Production Economics, vol.123, issue.2, pp.247-256, 2010.
DOI : 10.1016/j.ijpe.2009.08.022

S. Helber, F. Sahling, and K. Schimmelpfeng, Dynamic capacitated lot sizing with random demand and dynamic safety stocks, OR Spectrum, vol.10, issue.1, 2012.
DOI : 10.1007/s00291-012-0283-6
URL : http://hdl.handle.net/10419/66019

K. S. Hindi, Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search, Computers & Industrial Engineering, vol.28, issue.4, pp.701-707, 1995.
DOI : 10.1016/0360-8352(95)00027-X

K. S. Hindi, Solving the CLSP by a Tabu Search Heuristic, Journal of the Operational Research Society, vol.47, issue.1, pp.151-161, 1996.
DOI : 10.1057/jors.1996.13

D. J. Hoitomt, P. B. Luh, and K. R. Pattipati, A practical approach to job-shop scheduling problems, IEEE Transactions on Robotics and Automation, vol.9, issue.1, pp.1-13, 1993.
DOI : 10.1109/70.210791

W. Hsu, On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine, Management Science, vol.29, issue.1, pp.93-105, 1983.
DOI : 10.1287/mnsc.29.1.93

Y. Hung and K. Chien, A multi-class multi-level capacitated lot sizing model, Journal of the Operational Research Society, vol.51, issue.11, pp.1309-1318, 2000.
DOI : 10.1057/palgrave.jors.2601026

M. Iranpoor, S. M. Fatemi-ghomi, and A. Mohamadinia, Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon, Applied Mathematics and Computation, vol.184, issue.2, pp.950-964, 2007.
DOI : 10.1016/j.amc.2006.05.188

F. R. Jacobs, W. L. Berry, D. C. Whybark, and T. E. Vollmann, Manufacturing Planning and Control for Supply Chain Management : APICS/CPIM Certification Edition, 2011.

A. S. Jain and S. Meeran, Deterministic job-shop scheduling: Past, present and future, European Journal of Operational Research, vol.113, issue.2, pp.390-434, 1999.
DOI : 10.1016/S0377-2217(98)00113-1

R. J. James and B. Almada-lobo, Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics, Computers & Operations Research, vol.38, issue.12, pp.12-1816, 2011.
DOI : 10.1016/j.cor.2011.02.005
URL : http://hdl.handle.net/10216/56805

R. Jans and Z. Degraeve, An industrial extension of the discrete lot-sizing and scheduling problem, IIE Transactions, vol.75, issue.1, pp.47-58, 2004.
DOI : 10.1287/opre.37.5.741

C. Jordan and A. Drexl, Discrete Lotsizing and Scheduling by Batch Sequencing, Management Science, vol.44, issue.5, pp.698-713, 1998.
DOI : 10.1287/mnsc.44.5.698
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.8216

C. Jordan and J. And-koppelmann, Multi-level lotsizing and scheduling by batch sequencing, Journal of the Operational Research Society, vol.49, issue.11, pp.1212-1218, 1998.
DOI : 10.1057/palgrave.jors.2600579
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.5151

I. Kacem, Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval, Journal of Combinatorial Optimization, vol.2, issue.3, pp.117-133, 2007.
DOI : 10.1007/s10878-007-9102-4

I. Kacem, C. Chu, and A. Souissi, Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times, Computers & Operations Research, vol.35, issue.3, pp.827-844, 2008.
DOI : 10.1016/j.cor.2006.04.010

I. Kacem and H. Kellerer, Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates, Journal of Scheduling, vol.121, issue.1, pp.257-265, 2011.
DOI : 10.1007/s10951-009-0146-4

W. Kaczmarczyk, Proportional lot-sizing and scheduling problem with identical parallel machines, International Journal of Production Research, vol.43, issue.9, pp.2605-2623, 2011.
DOI : 10.1016/S0377-2217(97)89646-4

M. Kannegiesser, Value Chain Management In Value Chain Management in the Chemical Industry : Global Value Chain Planning of Commodities, pp.11-61, 2008.

B. Karimi, S. M. Fatemi-ghomi, W. , and J. M. , The capacitated lot sizing problem: a review of models and algorithms, Omega, vol.31, issue.5, pp.365-378, 2003.
DOI : 10.1016/S0305-0483(03)00059-8

U. S. Karmarkar, S. Kekre, and S. Kekre, The Dynamic Lot-Sizing Problem with Startup and Reservation Costs, Operations Research, vol.35, issue.3, pp.389-398, 1987.
DOI : 10.1287/opre.35.3.389

U. S. Karmarkar and L. Schrage, The Deterministic Dynamic Product Cycling Problem, Operations Research, vol.33, issue.2, pp.326-345, 1985.
DOI : 10.1287/opre.33.2.326

A. Kimms, Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets, International Journal of Production Research, vol.355, issue.8, pp.2279-2298, 1996.
DOI : 10.1007/BF01720518

A. Kimms, Multi-level, single-machine lot sizing and scheduling (with initial inventory), European Journal of Operational Research, vol.89, issue.1, pp.86-99, 1996.
DOI : 10.1016/S0377-2217(96)90056-9

A. Kimms, A genetic algorithm for multi-level, multi-machine lot sizing and scheduling, Computers & Operations Research, vol.26, issue.8, pp.829-848, 1999.
DOI : 10.1016/S0305-0548(98)00089-6

A. Kimms and A. Drexl, Proportional lot sizing and scheduling: Some extensions, Networks, vol.32, issue.2, pp.85-101, 1998.
DOI : 10.1002/(SICI)1097-0037(199809)32:2<85::AID-NET2>3.0.CO;2-E

A. Kimms and A. Drexl, Some insights into proportional lot sizing and scheduling, Journal of the Operational Research Society, vol.49, issue.11, pp.1196-1205, 1998.
DOI : 10.1057/palgrave.jors.2600632

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science, vol.220, pp.4598-671, 1983.

R. Kolisch, Make-to-Order Assembly Management, 2001.
DOI : 10.1007/978-3-662-04514-5

R. E. Korf, Depth-first iterative-deepening, Artificial Intelligence, vol.27, issue.1, pp.97-109, 1985.
DOI : 10.1016/0004-3702(85)90084-0

A. Kovács, K. N. Brown, A. Tarim, and S. , An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups, International Journal of Production Economics, vol.118, issue.1, pp.282-291, 2009.
DOI : 10.1016/j.ijpe.2008.08.033

S. Lamouri and A. Thomas, Flux poussés : MRP et DRP. Techniques de l'ingénieur Modes de pilotage des flux logistiques base docum, ref, pp.5110-5111, 2000.

A. H. Land and A. G. Doig, An Automatic Method of Solving Discrete Programming Problems, Econometrica, vol.28, issue.3, pp.497-520, 1960.
DOI : 10.2307/1910129

J. C. Lang and Z. M. Shen, Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions, European Journal of Operational Research, vol.214, issue.3, pp.595-605, 2011.
DOI : 10.1016/j.ejor.2011.05.014

J. Lasserre, An Integrated Model for Job-Shop Planning and Scheduling, Management Science, vol.38, issue.8, pp.1201-1211, 1992.
DOI : 10.1287/mnsc.38.8.1201

C. Lemaréchal, Lagrangian Relaxation, pp.112-156, 2001.
DOI : 10.1007/3-540-45586-8_4

J. K. Lenstra, R. Kan, A. H. Brucker, and P. , Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, vol.1, pp.343-362, 1977.
DOI : 10.1016/S0167-5060(08)70743-X

A. Leon, Enterprise Resource Planning, 2008.

A. Lew and H. Mauch, Dynamic Programming : A Computational Tool, 2007.

Z. Li and M. G. Ierapetritou, Integrated production planning and scheduling using a decomposition framework, Chemical Engineering Science, vol.64, issue.16, pp.3585-3597, 2009.
DOI : 10.1016/j.ces.2009.04.047

Z. Li and M. G. Ierapetritou, Production planning and scheduling integration through augmented Lagrangian optimization, Computers & Chemical Engineering, vol.34, issue.6, pp.996-1006, 2010.
DOI : 10.1016/j.compchemeng.2009.11.016
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.9052

Z. Li and M. G. Ierapetritou, Rolling horizon based planning and scheduling integration with production capacity consideration, Chemical Engineering Science, vol.65, issue.22, pp.5887-5900, 2010.
DOI : 10.1016/j.ces.2010.08.010

C. Liaw, An iterative improvement approach for the nonpreemptive open shop scheduling problem, European Journal of Operational Research, vol.111, issue.3, pp.509-517, 1998.
DOI : 10.1016/S0377-2217(97)00366-4

J. Maes, J. O. Mcclain, and L. N. Van-wassenhove, Multilevel capacitated lotsizing complexity and LP-based heuristics, European Journal of Operational Research, vol.53, issue.2, pp.131-148, 1991.
DOI : 10.1016/0377-2217(91)90130-N

C. T. Maravelias, S. , and C. , Integration of production planning and scheduling: Overview, challenges and opportunities, Computers & Chemical Engineering, vol.33, issue.12, pp.1919-1930, 2009.
DOI : 10.1016/j.compchemeng.2009.06.007

F. Marinelli, M. E. Nenni, and A. Sforza, Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company, Annals of Operations Research, vol.1, issue.1, pp.177-192, 2007.
DOI : 10.1007/s10479-006-0157-x

I. Maros, Computational Techniques of the Simplex Method, 2003.
DOI : 10.1007/978-1-4615-0257-9

G. R. Mateus, M. Gómez-ravetti, D. Souza, M. C. Valeriano, and T. M. , Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration, Journal of Scheduling, vol.38, issue.3, pp.245-259, 2010.
DOI : 10.1007/s10951-009-0156-2

Y. Mati, S. Dauzère-pérès, and C. Lahlou, A general approach for optimizing regular criteria in the job-shop scheduling problem, European Journal of Operational Research, vol.212, issue.1, pp.33-42, 2011.
DOI : 10.1016/j.ejor.2011.01.046
URL : https://hal.archives-ouvertes.fr/emse-00613008

A. Mehra, I. Minis, and J. M. Proth, Hierarchical production planning for complex manufacturing systems, Advances in Engineering Software, vol.26, issue.3, pp.209-218, 1996.
DOI : 10.1016/0965-9978(95)00117-4

A. A. Menezes, A. R. Clark, and B. Almada-lobo, Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups, Journal of Scheduling, vol.38, issue.11, pp.209-219, 2010.
DOI : 10.1007/s10951-010-0197-6

H. Meyr, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, European Journal of Operational Research, vol.120, issue.2, pp.311-326, 2000.
DOI : 10.1016/S0377-2217(99)00159-9

H. Meyr, Simultaneous lotsizing and scheduling on parallel machines, European Journal of Operational Research, vol.139, issue.2, pp.277-292, 2002.
DOI : 10.1016/S0377-2217(01)00373-3

H. H. Millar, Y. , and M. , Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering, International Journal of Production Economics, vol.34, issue.1, pp.1-15, 1994.
DOI : 10.1016/0925-5273(94)90042-6

H. Min and G. Zhou, Supply chain modeling: past, present and future, Computers & Industrial Engineering, vol.43, issue.1-2, pp.231-249, 2002.
DOI : 10.1016/S0360-8352(02)00066-9

N. Mladenovi? and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, pp.1097-1100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2

M. Mohammadi, Integrating lotsizing, loading, and scheduling decisions in flexible flow shops, The International Journal of Advanced Manufacturing Technology, vol.38, issue.1, pp.9-12, 2010.
DOI : 10.1007/s00170-010-2594-6

M. Mohammadi, S. M. Fatemi-ghomi, B. Karimi, and S. A. Torabi, Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lotsizing problem with sequence-dependent setups, Journal of Intelligent Manufacturing, vol.5, issue.1, pp.501-510, 2008.
DOI : 10.1007/s10845-008-0207-0

M. Mohammadi, S. M. Fatemi-ghomi, B. Karimi, and S. A. Torabi, MIPbased heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups, International Journal of Production Research, vol.48, pp.10-2957, 2010.

S. Mohan, M. Gopalakrishnan, R. Marathe, and A. Rajan, A note on modelling the capacitated lot-sizing problem with set-up carryover and set-up splitting, International Journal of Production Research, vol.50, issue.19, pp.19-5538, 2012.
DOI : 10.1287/mnsc.35.3.353

F. Neri, C. Cotta, and P. Moscato, Handbook of Memetic Algorithms, 2012.
DOI : 10.1007/978-3-642-23247-3

C. T. Ng, J. Wang, T. C. Cheng, and L. L. Liu, A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs, Computers & Operations Research, vol.37, issue.1, pp.83-90, 2010.
DOI : 10.1016/j.cor.2009.03.019

J. Ouenniche, F. F. Boctor, and A. Martel, The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops, International Journal of Production Research, vol.37, issue.10, pp.10-2253, 1999.
DOI : 10.1080/002075499190752

H. Ouerfelli, A. Dammak, K. Chtourou, and E. K. , Benders decomposition method for an integrated problem of production Lot-sizing and Scheduling, 2009 International Conference on Computers & Industrial Engineering, pp.323-327
DOI : 10.1109/ICCIE.2009.5223790

L. Özdamar and G. Barbarosoglu, An integrated Lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot sizing problem, International Journal of Production Economics, vol.68, issue.3, pp.319-331, 2000.
DOI : 10.1016/S0925-5273(99)00100-0

L. Özdamar and M. A. Bozyel, The capacitated lot sizing problem with overtime decisions and setup times, IIE Transactions, vol.32, issue.11, pp.1043-1057, 2000.

M. Patil, G. Akrani, and M. Katyani, Types of Production System -Intermittent and Continuous. Kalyan City LifeOnline, 2014.

P. Lopes, M. J. De-carvalho, and J. , A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, European Journal of Operational Research, vol.176, issue.3, pp.1508-1527, 2007.
DOI : 10.1016/j.ejor.2005.11.001

F. Pezzella, G. Morganti, C. , and G. , A genetic algorithm for the Flexible Job-shop Scheduling Problem, Computers & Operations Research, vol.35, issue.10, pp.3202-3212, 2008.
DOI : 10.1016/j.cor.2007.02.014

M. L. Pinedo, Planning and scheduling in manufacturing and services, 2009.
DOI : 10.1007/978-1-4419-0910-7

M. L. Pinedo, Scheduling -Theory, Algorithms, and Systems

E. N. Pistikopoulos, M. C. Georgiadis, and V. Dua, Multi-parametric programming : theory, algorithms and applications, 2007.
DOI : 10.1002/9783527631216

R. J. Plevin, M. O-'hare, A. D. Jones, M. S. Torn, and H. K. Gibbs, Greenhouse Gas Emissions from Biofuels??? Indirect Land Use Change Are Uncertain but May Be Much Greater than Previously Estimated, Environmental Science & Technology, vol.44, issue.21, pp.8015-8021, 2010.
DOI : 10.1021/es101946t

Y. Pochet and L. A. Wolsey, Production Planning by Mixed Integer Programming, 2006.

C. N. Potts and M. Y. Kovalyov, Scheduling with batching: A review, European Journal of Operational Research, vol.120, issue.2, pp.228-249, 2000.
DOI : 10.1016/S0377-2217(99)00153-8

S. Prasad and Y. Liao, Multi-Product Lot Scheduling with Backordering and Shelf- Life Constraints, Omega, 2012.

C. A. Ptak and C. Smith, Orlicky's Material Requirements Planning, 2011.

D. Quadt and H. Kuhn, Capacitated lot-sizing with extensions: a review, 4OR, vol.36, issue.4, pp.61-83, 2008.
DOI : 10.1007/s10288-007-0057-1

R. Z. Ríos-mercado and J. Bard, Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups, Computers & Operations Research, vol.25, issue.5, pp.351-366, 1998.
DOI : 10.1016/S0305-0548(97)00079-8

M. Rocha-de-paula, M. Gómez-ravetti, G. R. Mateus, P. , and P. M. , Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search, IMA Journal of Management Mathematics, vol.18, issue.2, pp.101-115, 2007.
DOI : 10.1093/imaman/dpm016

W. Roux, S. Dauzère-pérès, and J. Lasserre, Planning and scheduling in a multi-site environment, Production Planning & Control, vol.10, issue.1, pp.19-28, 1999.
DOI : 10.1080/095372899233389

B. Roy and B. Sussmann, Les problèmes d'ordonnancement avec contraintes disjonctives, SEMA, Note D.S. No. 9 bis, 1964.

A. Ruszczy?ski, On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization, Mathematics of Operations Research, vol.20, issue.3, pp.634-656, 1995.
DOI : 10.1287/moor.20.3.634

C. Sadfi, B. Penz, C. Rapine, J. B?a?ewicz, and P. Formanowicz, An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints, European Journal of Operational Research, vol.161, issue.1, pp.3-10, 2005.
DOI : 10.1016/j.ejor.2003.08.026
URL : https://hal.archives-ouvertes.fr/hal-00239327

F. Sahling, L. Buschkühl, H. Tempelmeier, and S. Helber, Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic, Computers & Operations Research, vol.36, issue.9, pp.2546-2553, 2009.
DOI : 10.1016/j.cor.2008.10.009

M. Salomon, L. G. Kroon, R. Kuik, V. Wassenhove, and L. N. , Some Extensions of the Discrete Lotsizing and Scheduling Problem, Management Science, vol.37, issue.7, pp.801-812, 1991.
DOI : 10.1287/mnsc.37.7.801

M. Salomon, M. M. Solomon, L. N. Van-wassenhove, Y. Dumas, and S. Dauzère-pérès, 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

R. A. Sandbothe, A user interactive heuristic procedure for solving the multiple product cycling problem, Computers & Operations Research, vol.23, issue.9, pp.897-907, 1996.
DOI : 10.1016/0305-0548(95)00050-X

F. Seeanner, B. Almada-lobo, and H. Meyr, Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems, Computers & Operations Research, vol.40, issue.1, pp.303-317, 2013.
DOI : 10.1016/j.cor.2012.07.002

F. Seeanner and H. Meyr, Multi-stage simultaneous lot-sizing and scheduling for flow line production, OR Spectrum, vol.38, issue.11, pp.33-73, 2013.
DOI : 10.1007/s00291-012-0296-1

N. K. Shah and M. G. Ierapetritou, Integrated production planning and scheduling optimization of multisite, multiproduct process industry, Computers & Chemical Engineering, vol.37, pp.214-226, 2012.
DOI : 10.1016/j.compchemeng.2011.08.007

K. Sheikh, Manufacturing Resource Planning (MRP II) : With an introduction to ERP, SCM, and CRM, 2003.

I. Shim, H. Kim, H. Doh, L. , and D. , A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs, Computers & Industrial Engineering, vol.61, issue.4, pp.920-929, 2011.
DOI : 10.1016/j.cie.2011.06.002

E. Silver and H. Meal, A heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment, Production and Inventory Management, vol.14, pp.64-74, 1973.

H. Stadtler, Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing, European Journal of Operational Research, vol.94, issue.3, pp.561-581, 1996.
DOI : 10.1016/0377-2217(95)00094-1

H. Stadtler, Multi-level single machine lot-sizing and scheduling with zero lead times, European Journal of Operational Research, vol.209, issue.3, pp.241-252, 2011.
DOI : 10.1016/j.ejor.2010.09.022

H. Stadtler, B. Fleischmann, M. Grunow, H. Meyr, and C. Sürie, Advanced Planning in Supply Chains : Illustrating the Concepts Using an SAP APO Case Study, Management for Professionals, pp.21-34
DOI : 10.1007/978-3-642-24215-1

H. Stadtler and C. Kilger, Supply Chain Management and Advanced Planning : Concepts, Models, Software and Case Studies, 2008.

C. Suerie, Modeling of period overlapping setup times, European Journal of Operational Research, vol.174, issue.2, pp.874-886, 2006.
DOI : 10.1016/j.ejor.2005.03.033

E. Talbi, Metaheuristics From Design to Implementation, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00750681

H. Tempelmeier, A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint, Omega, vol.39, issue.6, pp.627-633, 2011.
DOI : 10.1016/j.omega.2011.01.003

H. Tempelmeier and L. Buschkühl, Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource, International Journal of Production Economics, vol.113, issue.1, pp.401-412, 2008.
DOI : 10.1016/j.ijpe.2007.10.001

H. Tempelmeier and M. Derstroff, A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times, Management Science, vol.42, issue.5, pp.738-757, 1996.
DOI : 10.1287/mnsc.42.5.738

H. Tempelmeier and S. Helber, A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures, European Journal of Operational Research, vol.75, issue.2, pp.296-311, 1994.
DOI : 10.1016/0377-2217(94)90076-0

H. Tempelmeier and S. Herpers, ???a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint, International Journal of Production Research, vol.29, issue.17, pp.5181-5193, 2010.
DOI : 10.1016/0377-2217(85)90001-3

J. M. Thizy, Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem, INFOR: Information Systems and Operational Research, vol.29, issue.4, pp.271-283, 1991.
DOI : 10.1080/03155986.1991.11732175

J. M. Thizy, V. Wassenhove, and L. N. , Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem: A Heuristic Implementation, IIE Transactions, vol.14, issue.7, pp.308-313, 1985.
DOI : 10.1080/07408178508975308

L. Tiacci and S. Saetta, Demand forecasting, lot sizing and scheduling on a rolling horizon basis, International Journal of Production Economics, vol.140, issue.2, pp.1-12, 1997.
DOI : 10.1016/j.ijpe.2012.02.007

F. M. Toledo and V. A. Armentano, A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines, European Journal of Operational Research, vol.175, issue.2, pp.1070-1083, 2006.
DOI : 10.1016/j.ejor.2005.06.029

E. A. Toso, R. Morabito, C. , and A. R. , Lot sizing and sequencing optimisation at an animal-feed plant, Computers & Industrial Engineering, vol.57, issue.3, pp.813-821, 2009.
DOI : 10.1016/j.cie.2009.02.011
URL : http://eprints.uwe.ac.uk/7374/1/Toso_Morabito_Clark_CIE_2009.pdf

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

R. J. Vaessens, E. H. Aarts, and J. K. Lenstra, Job Shop Scheduling by Local Search, INFORMS Journal on Computing, vol.8, issue.3, pp.302-317, 1996.
DOI : 10.1287/ijoc.8.3.302

S. Van-hoesel, R. Kuik, M. Salomon, V. Wassenhove, and L. N. , The single-item discrete lotsizing and scheduling problem: optimization by linear and dynamic programming, Discrete Applied Mathematics, vol.48, issue.3, pp.289-303, 1994.
DOI : 10.1016/0166-218X(92)00182-L

P. J. Van-laarhoven, E. H. Aarts, and J. K. Lenstra, Job Shop Scheduling by Simulated Annealing, Operations Research, vol.40, issue.1, pp.113-125, 1992.
DOI : 10.1287/opre.40.1.113

F. Vanderbeck, Lot-Sizing with Start-Up Times, Management Science, vol.44, issue.10, pp.1409-1425, 1998.
DOI : 10.1287/mnsc.44.10.1409

V. ?erný, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications, vol.21, issue.1, pp.41-51, 1985.
DOI : 10.1007/BF00940812

J. Venkateswaran, S. , and Y. , Hybrid system dynamic???discrete event simulation-based architecture for hierarchical production planning, International Journal of Production Research, vol.11, issue.20, pp.4397-4429, 2005.
DOI : 10.1016/S0951-5240(97)00022-0

A. Wagelmans, S. Van-hoesel, and A. Kolen, Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case, Operations Research, vol.40, issue.1-supplement-1, pp.145-156, 1992.
DOI : 10.1287/opre.40.1.S145

H. M. Wagner and T. M. Whitin, 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

G. Waligóra, Tabu search for discrete???continuous scheduling problems with heuristic continuous resource allocation, European Journal of Operational Research, vol.193, issue.3, pp.849-856, 2009.
DOI : 10.1016/j.ejor.2007.11.009

C. Wolosewicz, Approche intégrée en planification et ordonnancement de la production, 2008.

C. Wolosewicz, S. Dauzère-pérès, and R. Aggoune, A NEW APPROACH FOR SOLVING INTEGRATED PLANNING AND SCHEDULING PROBLEM, IFAC Proceedings Volumes, vol.39, issue.3, p.2006, 2006.
DOI : 10.3182/20060517-3-FR-2903.00112

C. Wolosewicz, S. Dauzère-pérès, and R. Aggoune, A solving procedure for a general integrated lot sizing and fixed scheduling problem, Submitted to European Journal of Operational Research, 2012.

L. A. Wolsey, Integer Programming, 1998.

L. A. Wolsey, Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation, Management Science, vol.48, issue.12, pp.1587-1602, 2002.
DOI : 10.1287/mnsc.48.12.1587.442

T. Wu and L. Shi, Mathematical models for capacitated multi-level production planning problems with linked lot sizes, International Journal of Production Research, vol.31, issue.20, pp.6227-6247, 2011.
DOI : 10.1287/mnsc.42.5.738

T. Wu, L. Shi, J. Geunes, and K. Akartunal?, An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging, European Journal of Operational Research, vol.214, issue.2, pp.428-441, 2011.
DOI : 10.1016/j.ejor.2011.04.029

Y. Xiao, I. Kaku, Q. Zhao, and R. Zhang, A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems, European Journal of Operational Research, vol.214, issue.2, pp.223-231, 2011.
DOI : 10.1016/j.ejor.2011.04.015

M. Xpress, Xpress MP software development, Dash Optimization. Englewoods Cliffs, 2006.

M. Zhang, Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty, Operations Research Letters, vol.39, issue.5, pp.342-345, 2011.
DOI : 10.1016/j.orl.2011.06.013

X. Zhang, Y. , and H. , Integrated optimization of production planning and scheduling for a kind of job-shop, The International Journal of Advanced Manufacturing Technology, vol.29, issue.7-8, pp.7-8, 2005.
DOI : 10.1007/s00170-003-2042-y