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

R. Ruiz and C. Maroto, A comprehensive review and evaluation of permutation flowshop heuristics, European Journal of Operational Research, vol.165, issue.2, pp.479-494, 2005.
DOI : 10.1016/j.ejor.2004.04.017

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, pp.2033-2049, 2007.
DOI : 10.1016/j.ejor.2005.12.009

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

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, vol.5, pp.287-326, 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-68, 1954.
DOI : 10.1002/nav.3800010110

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

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

S. Wright, The roles of mutation, inbreeding, crossbreeding and selection in evolution, Proceedings of the Sixth International Congress on Genetics, 1932.

E. Van-nimwegen, J. Crutchfield, and M. Huynen, Neutral evolution of mutational robustness, Proc. Nat. Acad. Sci. USA 96, pp.9716-9720, 1999.
DOI : 10.1073/pnas.96.17.9716

C. O. Wilke, Adaptive Evolution on Neutral Networks, Bulletin of Mathematical Biology, vol.63, issue.4, pp.715-730, 2001.
DOI : 10.1006/bulm.2001.0244

S. Vérel, P. Collard, M. Tomassini, and L. Vanneschi, Fitness landscape of the cellular automata majority problem: View from the ???Olympus???, Theoretical Computer Science, vol.378, issue.1, pp.378-54, 2007.
DOI : 10.1016/j.tcs.2007.01.001

U. Bastolla, M. Porto, H. E. Roman, and M. Vendruscolo, Statistical Properties of Neutral Evolution, Journal of Molecular Evolution, vol.57, issue.0, pp.103-119, 2003.
DOI : 10.1007/s00239-003-0013-4

E. D. Weinberger, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biological Cybernetics, vol.1, issue.5, pp.325-336, 1990.
DOI : 10.1007/BF00202749

L. Altenberg, The evolution of evolvability in genetic programming Advances in Genetic Programming, pp.47-74, 1994.

S. Verel, P. Collard, and M. Clergue, Measuring the evolvability landscape to study neutrality, Proceedings of the 8th annual conference on Genetic and evolutionary computation , GECCO '06, pp.613-614, 2006.
DOI : 10.1145/1143997.1144107
URL : https://hal.archives-ouvertes.fr/hal-00164917

S. Verel, P. Collard, and M. Clergue, Scuba search: when selection meets innovation, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), pp.924-931, 2004.
DOI : 10.1109/CEC.2004.1330960
URL : https://hal.archives-ouvertes.fr/hal-00160035

M. E. Marmion, C. Dhaenens, L. Jourdan, A. Liefooghe, and S. Verel, NILS: A Neutrality-Based Iterated Local Search and Its Application to Flowshop Scheduling, 11th European Conference on Evolutionary Computation in Combinatorial Optimisation(EvoCOP11). LNCS, 2011.
DOI : 10.1007/978-3-642-20364-0_17
URL : https://hal.archives-ouvertes.fr/hal-00563459