. Codato, . Fischetti, G. Codato, and M. Fischetti, Combinatorial Benders' Cuts for Mixed-Integer Linear Programming, Operations Research, vol.54, issue.4, pp.756-766, 2006.
DOI : 10.1287/opre.1060.0286
URL : http://www.dei.unipd.it/~fisch/papers/combinatorial_benders_cuts_for_milp.pdf

R. Vaessens, In Flow and open shop scheduling on two machines with transportation times and machineindependant processing times is NP-hard, 1996.

. Desaulniers, Column generation, 2006.
DOI : 10.1007/b135457

. Fondrevelle, Permutation flowshop scheduling problems with maximal and minimal time lags, Computers & Operations Research, vol.33, issue.6, pp.1540-1556, 2006.
DOI : 10.1016/j.cor.2004.11.006
URL : https://hal.archives-ouvertes.fr/inria-00100091

. Garey, The Complexity of Flowshop and Jobshop Scheduling, Mathematics of Operations Research, vol.1, issue.2, pp.117-129, 1976.
DOI : 10.1287/moor.1.2.117

. Grabowski, A block approach for single-machine scheduling with release dates and due dates, European Journal of Operational Research, vol.26, issue.2, pp.278-285, 1986.
DOI : 10.1016/0377-2217(86)90191-8

. Graham, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Discrete Optimization II of Annals of Discrete Mathematics, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X
URL : https://ir.cwi.nl/pub/18052/18052A.pdf

L. A. Hall, A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem, Mathematics of Operations Research, vol.19, issue.1, pp.68-85, 1994.
DOI : 10.1287/moor.19.1.68

. Hodson, A microcomputer based solution to a practical scheduling problem, The Journal of the Operational Research Society, issue.10, pp.36903-914, 1985.
DOI : 10.1057/jors.1985.160

S. M. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, vol.1, issue.1, pp.61-68, 1954.
DOI : 10.1002/nav.3800010110

H. Nagamochi, A better approximation for the two-machine flowshop scheduling problem with time lags, Algorithms and Computation, 14th International Symposium Proceedings, pp.309-318, 2003.

. Keha, Mixed integer programming formulations for single machine scheduling problems, Computers & Industrial Engineering, vol.56, issue.1, pp.357-367, 2009.
DOI : 10.1016/j.cie.2008.06.008

L. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.53-72, 1980.
DOI : 10.1016/0041-5553(80)90061-0

. Kim, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, European Journal of Operational Research, vol.91, issue.1, pp.124-143, 1996.
DOI : 10.1016/0377-2217(95)00119-0

. Kovalyov, . Werner, M. Y. Kovalyov, and F. Werner, A polynomial approximation scheme for problem F2/rj/Cmax, Operations Research Letters, vol.20, issue.2, pp.75-79, 1997.
DOI : 10.1016/S0167-6377(96)00049-1

. Lawler, Sequencing and scheduling: Algorithms and complexity, Handbooks in operations research and management science, pp.445-522, 1993.
DOI : 10.1016/s0927-0507(05)80189-6

. Lenstra, Complexity of Machine Scheduling Problems, Studies in Integer Programming, pp.343-362, 1977.
DOI : 10.1016/S0167-5060(08)70743-X
URL : https://ir.cwi.nl/pub/18051/18051A.pdf

. Bibliography and . Miller, Integer programming formulation of traveling salesman problems, J. ACM, vol.7, issue.4, pp.326-329, 1960.

L. Mitten, Jobs on Two Machines with Arbitrary Time Lags, Management Science, vol.5, issue.3, pp.293-298, 1959.
DOI : 10.1287/mnsc.5.3.293

. Mkadem, Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays, Annual International Conference of the German Operations Research Society, 2016.
DOI : 10.1287/mnsc.5.3.293
URL : https://hal.archives-ouvertes.fr/hal-01551051

. Mkadem, An exact method for solving the two-machine flow-shop problem with time delays, The 13th Workshop on Models and Algorithms for Planning and Scheduling Problems Proceedings of the 13th Workshop on Models and Algorithms for Planning and Scheduling Problems, pp.175-176, 2017.
DOI : 10.1007/978-3-319-55702-1_70
URL : https://hal.archives-ouvertes.fr/hal-01544655

. Mkadem, A branch-and-bound algorithm for the two-machine flow-shop problem with time delays, 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), 2017.
DOI : 10.1109/CoDIT.2017.8102675
URL : https://hal.archives-ouvertes.fr/hal-01551056

. Mkadem, Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays, pp.527-533, 2018.
DOI : 10.1287/mnsc.5.3.293
URL : https://hal.archives-ouvertes.fr/hal-01551051

. Moukrim, A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays, RAIRO - Operations Research, vol.48, issue.2, pp.235-254, 2014.
DOI : 10.1287/opre.26.1.36
URL : https://hal.archives-ouvertes.fr/hal-01062809

. Msakni, Minimizing the total completion time in a two-machine flowshop problem with time delays, Engineering Optimization, vol.26, issue.1, pp.481164-1181, 2016.
DOI : 10.1016/j.ipl.2010.04.002

. Nawaz, A heuristic algorithm for the n-job, m-machine sequencing problem, Management Science, vol.16, pp.630-637, 1983.
DOI : 10.1016/0305-0483(83)90088-9

M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, 2008.

C. N. Potts, Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates, Mathematics of Operations Research, vol.10, issue.4, pp.576-584, 1985.
DOI : 10.1287/moor.10.4.576

G. Verfaillie, Nogood recording for static and dynamic constraint satisfaction problems, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93), pp.48-55, 1993.

. Soukhal, Complexity of flow shop scheduling problems with transportation constraints, IEPM: Focus on Scheduling, pp.32-41, 2005.
DOI : 10.1016/j.ejor.2003.03.002
URL : http://www.betsaonline.com/articles/ComplexityTransportation.pdf

L. Su, A hybrid two-stage flowshop with limited waiting time constraints, Computers & Industrial Engineering, vol.44, issue.3, pp.409-424, 2003.
DOI : 10.1016/S0360-8352(02)00216-4

A. Turing, On computable numbers with an application to the â?? Entscheidungsproblemâ??, 1936.

Y. , C. Yang, D. Chern, and M. , A two-machine flowshop sequencing problem with limited waiting time constraints, Computers & Industrial Engineering, vol.28, issue.1, pp.63-70, 1995.
DOI : 10.1016/0360-8352(94)00026-j

W. Yu, The two-machine flow shop problem and the one-machine total tardiness problem, 1996.

X. Zhang and S. Van-de-velde, Polynomial-time approximation schemes for scheduling problems with time lags, Journal of Scheduling, vol.7, issue.5, pp.553-559, 2010.
DOI : 10.1057/palgrave.jors.2600769
URL : https://link.springer.com/content/pdf/10.1007%2Fs10951-009-0134-8.pdf