R. L. Graham, E. L. Lawler, J. K. Lenstra, R. Kan, and A. H. , Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Mathematics, pp.5287-5326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

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

M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP- Completness, 1979.

M. Nawaz, . Enscore, E. E. Jr, and I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, vol.11, issue.1, pp.91-95, 1983.
DOI : 10.1016/0305-0483(83)90088-9

M. S. Nagano and J. Moccellin, A high quality solution constructive heuristic for flow shop sequencing, Journal of the Operational Research Society, vol.53, issue.12, pp.1374-1379, 2002.
DOI : 10.1057/palgrave.jors.2601466

J. M. Framinan, R. Leisten, and B. Ramamoorthy, Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem, International Journal of Production Research, vol.41, issue.1, pp.121-148, 2003.
DOI : 10.1080/00207540210161650

R. Companys, Métodos heurísticos en la resolución del problema del taller mecánico, Estudios Empresariales, vol.5, pp.7-18, 1966.

H. D. Pour, -machine flow-shop problem, Production Planning & Control, vol.12, issue.7, pp.648-653, 2001.
DOI : 10.1057/jors.1965.8
URL : https://hal.archives-ouvertes.fr/hal-01105389

S. S. Reddi and B. Ramamoorthy, On the Flow-Shop Sequencing Problem with No Wait in Process???, Journal of the Operational Research Society, vol.23, issue.3, pp.323-331, 1972.
DOI : 10.1057/jors.1972.52

N. G. Hall and C. Sriskandarajah, A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process, Operations Research, vol.44, issue.3, pp.510-525, 1996.
DOI : 10.1287/opre.44.3.510

C. H. Papadimitriou and P. C. Kanellakis, Flowshop scheduling with limited temporary storage, Journal of the ACM, vol.27, issue.3, pp.533-549, 1980.
DOI : 10.1145/322203.322213

. R. Leisten, Flowshop sequencing problems with limited buffer storage, International Journal of Production Research, vol.23, issue.11, pp.2085-2100, 1990.
DOI : 10.1080/00207549008942855

S. T. Mccormick, M. L. Pinedo, S. Shenker, and B. Wolf, Sequencing in an Assembly Line with Blocking to Minimize Cycle Time, Operations Research, vol.37, issue.6, pp.925-936, 1989.
DOI : 10.1287/opre.37.6.925

P. J. Kalczynski and J. Kamburowski, An improved NEH heuristic to minimize makespan in permutation flow shops, Computers & Operations Research, vol.35, issue.9, pp.3001-3008, 2008.
DOI : 10.1016/j.cor.2007.01.020

R. Companys and M. Mateo, Different behaviour of a double branch-and-bound algorithm on and problems, Computers & Operations Research, vol.34, issue.4, pp.938-53, 2007.
DOI : 10.1016/j.cor.2005.05.018

R. Companys, Note on the blocking flowshop problem Working paper, p.420, 2009.