H. G. Campbell, R. A. Dudek, and M. L. Smith, Machine Sequencing Problem, Management Science, vol.16, issue.10, pp.630-637, 1970.
DOI : 10.1287/mnsc.16.10.B630

D. G. Dannenbring, An Evaluation of Flow Shop Sequencing Heuristics, Management Science, vol.23, issue.11, pp.1174-1182, 1977.
DOI : 10.1287/mnsc.23.11.1174

J. Grabowski and M. Wodecki, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Computers & Operations Research, vol.31, issue.11, pp.1891-1909, 2004.
DOI : 10.1016/S0305-0548(03)00145-X

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy-kan, Optimisation and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, vol.5, pp.236-287, 1979.

P. Hansen and N. Mladenovic, Variable Neighborhood search, 2003.
DOI : 10.1007/978-0-387-74759-0_694
URL : https://hal.archives-ouvertes.fr/hal-00979295

. Kochenberger, Handbook of Metaheuristics, pp.145-184

S. Lin and B. W. Kernigham, An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Operations Research, vol.21, issue.2, pp.498-516, 1973.
DOI : 10.1287/opre.21.2.498

H. R. Lourenço, O. C. Martin, and T. Stützle, Iterated Local Search, 2003.
DOI : 10.1007/0-306-48056-5_11

. Kochenberger, Handbook of Metaheuristics, pp.321-353

N. Mladenovic 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
URL : https://hal.archives-ouvertes.fr/hal-00979295

M. Nawaz, 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

E. Nowicki and C. Smutniki, A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, vol.91, issue.1, pp.160-175, 1996.
DOI : 10.1016/0377-2217(95)00037-2

F. A. Ogbu and D. K. Smith, The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem, Computers & Operations Research, vol.17, issue.3, pp.243-253, 1990.
DOI : 10.1016/0305-0548(90)90001-N

I. H. Osman and C. N. Potts, Simulated annealing for permutation flow-shop scheduling, Omega, vol.17, issue.6, pp.551-557, 1989.
DOI : 10.1016/0305-0483(89)90059-5

C. R. Reeves, Improving the Efficiency of Tabu Search for Machine Sequencing Problems, Journal of the Operational Research Society, vol.44, issue.4, pp.375-382, 1993.
DOI : 10.1057/jors.1993.67

C. R. Reeves, A genetic algorithm for flowshop sequencing, Computers & Operations Research, vol.22, issue.1, pp.5-13, 1995.
DOI : 10.1016/0305-0548(93)E0014-K

C. R. Reeves and T. Yamada, Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem, Evolutionary Computation, vol.64, issue.1, pp.45-60, 1998.
DOI : 10.1016/0377-2217(89)90383-4

R. Kan and A. H. , Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff, The Hague, The Netherlands, 1976.
DOI : 10.1007/978-1-4613-4383-7

R. Ruiz and T. Stützle, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, vol.177, issue.3, 2006.
DOI : 10.1016/j.ejor.2005.12.009

T. Stützle, Applying iterated local search to the permutation flow shop problem, 1998.

E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research, vol.47, issue.1, pp.67-74, 1990.
DOI : 10.1016/0377-2217(90)90090-X

E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, issue.2, pp.278-285, 1993.
DOI : 10.1016/0377-2217(93)90182-M
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8802

M. Widmer and A. Hertz, A new heuristic method for the flow shop sequencing problem, European Journal of Operational Research, vol.41, issue.2, pp.186-193, 1989.
DOI : 10.1016/0377-2217(89)90383-4