, datamining (la capacité à trouver des solutions qui permettent une bonne classification sur des nouvelles données), la même conclusion est ainsi faite : Le Learning Tabu Search a obtenu de meilleurs résultats que la méthode classique de la recherche tabou. Cela s'explique par le faible nombre d'attributs sélectionnés par le Learning Tabu Search comparé aux autres méthodes. Ainsi, ces expérimentations montrent la contribution de l

A. Bibliographie, T. Et, and A. A. , «Total flowtime in no-wait flowshops with separated setup times», Computers & Operations Research, vol.25, pp.757-765, 1998.

A. , T. Et, and A. A. , «New heuristics for m-machine no-wait flowshop to minimize total completion time», Omega, vol.32, issue.5, pp.345-352, 2004.

A. , D. C. , and M. S. Nagano, «An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem», dans Advances in Artificial Intelligence, vol.36, p.46, 2010.

A. , A. , and Y. Hamadi, «Improving parallel local search for SAT», dans Lecture Notes in Computer Science, p.46, 2011.

A. , A. Et, and B. O. Sullivan, «Learning a stopping criteria for local search», vol.41, p.46, 2016.

A. , A. , and G. Rabadi, «Integrating estimation of distribution algorithms versus q-learning into meta-RaPS for solving the 0-1 multidimensional knapsack problem», Computers & Industrial Engineering, vol.112, p.46, 2017.

A. , P. , N. Cesa-bianchi, and P. Fischer, «Finite-time analysis of the multiarmed bandit problem», Machine Learning, vol.47, pp.235-256, 2002.

A. , M. A. , and A. E. Hassanien, «Modified cuckoo search algorithm with rough sets for feature selection», Neural Computing and Applications, vol.29, p.27, 2016.

B. , M. Et, and A. Goëffon, «On the efficiency of worst improvement for climbing NK-landscapes», dans Proceedings of the 2014 conference on Genetic and evolutioBIBLIOGRAPHIE nary computation-GECCO '14, 2014.

,

R. L. Becerra and C. A. Coello, «A cultural algorithm for solving the job shop scheduling problem», dans Knowledge Incorporation in Evolutionary Computation, vol.37, p.46, 2005.

B. , U. , M. G. Epitropakis, and E. K. Burke, «A hybrid breakout local search and reinforcement learning approach to the vertex separator problem», European Journal of Operational Research, vol.261, p.46, 2017.

B. and E. , «Heuristic algorithm for scheduling in the no-wait flowshop», Journal of Materials Processing Technology, vol.107, p.19, 2000.

B. , L. , V. C. Prakash, and S. Sapkal, 2017, «Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems», Algorithms, vol.10, p.21

B. , L. , P. Dell'olmo, and S. G. , «Flow shop no-wait scheduling with sequence dependent setup times and release dates», INFOR : Information Systems and Operational Research, vol.37, p.52, 1999.

M. C. Bonney and S. W. Gundry, «Solutions to the constrained flowshop sequencing problem», Journal of the Operational Research Society, vol.27, pp.869-883, 1976.

C. , D. , C. Zhang, and X. He, «Unsupervised feature selection for multi-cluster data», dans Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining-KDD '10, vol.26, p.27, 2010.

C. , L. , B. Xue, M. Zhang, and L. Shang, 2012, «Binary particle swarm optimisation for feature selection : A filter based approach», dans 2012 IEEE Congress on Evolutionary Computation, IEEE, vol.26, p.27

C. , D. , C. Dhaenens, and L. J. , «Synergies between operations research and data mining : The emerging use of multi-objective approaches», European Journal of Operational Research, vol.221, pp.469-479, 2012.

D. Bibliographie-davendra, I. Zelinka, M. Bialic-davendra, R. Senkerik, and R. J. , «Discrete self-organising migrating algorithm for flow-shop scheduling with no-wait makespan», Mathematical and Computer Modelling, vol.57, issue.1-2, pp.100-110, 2013.

D. , R. A. , and V. N. Temlyakov, «Some remarks on greedy algorithms», Advances in Computational Mathematics, vol.5, pp.173-187, 1996.

D. , J. , S. Song, J. N. Gupta, R. Zhang et al., «An improved iterated greedy algorithm with a tabu-based reconstruction strategy for the no-wait flowshop scheduling problem», vol.30, p.93, 2015.

D. , M. Et, and L. G. , «Ant colony system : a cooperative learning approach to the traveling salesman problem», IEEE Transactions on Evolutionary Computation, vol.1, p.46, 1997.

D. , M. , V. Maniezzo, and A. Colorni, «Ant system : optimization by a colony of cooperating agents», IEEE Transactions on Systems, Man and Cybernetics, vol.26, issue.1, p.100, 1996.

D. Santos, J. P. , J. D. De-melo, A. D. Neto, and D. A. , «Reactive search strategies using reinforcement learning, local search algorithms and variable neighborhood search», Expert Systems with Applications, vol.41, p.46, 2014.

D. , B. , J. Hao, and J. C. Hernandez, «A memetic algorithm for gene selection and molecular classification of cancer», dans Proceedings of the 11th Annual conference on Genetic and evolutionary computation-GECCO '09, vol.26, p.27, 2009.

E. , C. , A. Hunter, and J. M. , «A multiobjective evolutionary setting for feature selection and a commonality-based crossover operator», dans Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512), vol.26, p.27, 2000.

F. , U. Et, and W. Kern, «Some convergence results for probabilistic tabu search», ORSA Journal on Computing, vol.4, issue.1, pp.32-37, 1992.

F. and J. , Multi-agent systems : an introduction to distributed artificial intelligence, vol.1, p.11, 1999.

F. , J. M. , J. N. Gupta, and R. Leisten, «A review and classification of heuristics for permutation flow-shop scheduling with makespan objective», Journal BIBLIOGRAPHIE of the Operational Research Society, vol.55, pp.1243-1255, 2004.

G. , R. Et, and C. Rajendran, «Heuristic algorithms for scheduling in the no-wait flowshop», International Journal of Production Economics, vol.32, p.50, 1993.

G. , I. A. , and L. S. Smith, «Feature subset selection in large dimensionality domains», Pattern Recognition, vol.43, issue.1, p.27, 2010.

G. , P. C. , and R. E. Gomory, «Sequencing a one state-variable machine : A solvable case of the traveling salesman problem», Operations Research, vol.12, p.19, 1964.

G. , F. Et, and M. L. , «Tabu search», dans Handbook of Combinatorial Optimization, pp.2093-2229, 1998.

G. and B. , «A hybrid genetic algorithm approach for the "no-wait" flowshop scheduling problem», dans 1st International Conference on Genetic Algorithms in Engineering Systems : Innovations and Applications (GALESIA), 1995.

G. , J. Et, and J. P. , «Some local search algorithms for no-wait flow-shop problem with makespan criterion», Computers & Operations Research, vol.32, issue.8, pp.2197-2212, 2005.

G. , J. Et, and J. P. , «The permutation flow shop problem with blocking. a tabu search approach», Omega, vol.35, p.61, 2007.

G. , J. Et, and M. W. , «A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion», Computers & Operations Research, vol.31, pp.1891-1909, 2004.

G. , C. Et, D. W. , and M. Kaufmann, Proceedings-Genetic-Evolutionary-Computation-Conference/dp/ 1558606114?SubscriptionId=0JYN1NVW651KCA56C102&tag=techkie-20&, 1999.

G. , I. , S. Gunn, A. B. Hur, and G. D. , «Result analysis of the nips 2003 feature selection challenge», dans Proceedings of the 17th International Conference on Neural Information Processing Systems, NIPS'04, pp.545-552, 2004.

I. Bibliographie-guyon, M. Nikravesh, S. Gunn, and L. A. Zadeh, Feature Extraction, Springer Berlin Heidelberg, 2006.

H. , T. M. , J. Won, A. M. Alimi, and F. K. , «Multi-objective feature selection with NSGA II», dans Adaptive and Natural Computing Algorithms, vol.26, p.27, 2007.

H. , M. , S. Dumais, E. Osuna, J. Platt et al., «Support vector machines», IEEE Intelligent Systems and their Applications, vol.13, pp.18-28, 1998.

H. and J. H. , Adaptation in Natural and Artificial Systems, 1992.

J. Horn, N. Nafpliotis, and D. Goldberg, «A niched pareto genetic algorithm for multiobjective optimization», dans Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, vol.34, p.46, 1994.

I. , H. H. , M. Bagyamathi, and A. T. Azar, «A novel hybrid feature selection method based on rough set and improved harmony search», Neural Computing and Applications, vol.26, issue.8, p.27, 2015.

J. , B. , M. Eddaly, and P. Siarry, «A hybrid genetic algorithm for solving nowait flowshop scheduling problems», The International Journal of Advanced Manufacturing Technology, vol.54, pp.1129-1143, 2010.

J. , L. , D. Corne, D. Savic, and G. Walters, «Preliminary investigation of the 'learnable evolution model' for faster/better multiobjective water systems design», vol.36, p.42, 2005.

K. , J. , A. De, E. Carvalho, C. Hruschka et al., 2016, «Metalearning to select the best meta-heuristic for the traveling salesman problem : A comparison of meta-features», Neurocomputing, vol.205, p.46

K. , J. Et, and R. E. , «Particle swarm optimization», dans Proceedings of ICNN'95-International Conference on Neural Networks, 1995.

K. , J. R. , and A. S. Spachis, «Heuristics for flow-shop scheduling», International Journal of Production Research, vol.18, pp.345-357, 1980.

K. , J. Et, and H. N. , «Meta-modeling in multiobjective optimization», dans Multiobjective Optimization, vol.36, p.46, 2008.

K. , R. Et, and G. H. John, «Wrappers for feature subset selection», Artificial Intelligence, vol.97, issue.2, pp.273-324, 1997.

K. and L. , «Algorithm selection for combinatorial search problems : A survey», dans Data Mining and Constraint Programming, pp.149-190, 2016.

L. , D. Et, and U. K. Chakraborty, «A constructive heuristic for minimizing makespan in no-wait flow shop scheduling», The International Journal of Advanced Manufacturing Technology, vol.41, issue.1-2, p.50, 2008.

L. , T. N. , O. Chapelle, J. Weston, and A. E. , , pp.137-165, 2004.

L. , E. Et, and S. Voss, «Minimizing total tardiness on identical parallel machines using VNS with learning memory», dans Lecture Notes in Computer Science, vol.36, p.46, 2015.

L. , S. , M. Caserta, and I. M. Arango, «Tuning metaheuristics : A data mining based approach for particle swarm optimization», Expert Systems with Applications, vol.38, p.34, 2011.

L. I. , K. , A. Fialho, S. Kwong, and Q. Zhang, «Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition», IEEE Transactions on Evolutionary Computation, vol.18, p.46, 2014.

L. I. , X. , Q. Wang, and C. Wu, «Heuristic for no-wait flow shops with makespan minimization», International Journal of Production Research, vol.46, issue.9, pp.2519-2530, 2008.

L. and S. Y. , «Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics», Omega, vol.64, p.96, 2016.

L. , B. , L. Wang, and Y. J. , «An effective hybrid particle swarm optimization for no-wait flow shop scheduling», The International Journal of Advanced Manufacturing Technology, vol.31, issue.9, pp.1001-1011, 2006.

B. Marmion, M. , C. Dhaenens, L. Jourdan, A. Liefooghe et al., «The road to VEGAS», dans Proceedings of the 13th annual conference on Genetic and evolutionary computation-GECCO '11, Association for Computing Machinery, vol.42, p.46, 2011.

M. , Y. , A. Nowé, J. Suárez, and R. Bello, «A reinforcement learning approach for the flexible job shop scheduling problem», dans Lecture Notes in Computer Science, vol.39, p.46, 2011.

M. and R. S. , «Learnable evolution model : Evolutionary processes guided by machine learning», Machine Learning, vol.38, p.46, 2000.

M. , L. , L. Jourdan, M. K. Marmion, and C. D. , «Feature selection using tabu search with learning memory : Learning tabu search», dans Lecture Notes in Computer Science, pp.141-156, 2016.

M. , L. , M. Kessaci, and C. D. , «An Iterated Greedy-based Approach Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem», 2017.

M. , L. , M. Kessaci, and C. Dhaenens, «A new constructive heuristic for the no-wait flowshop scheduling problem», dans Lecture Notes in Computer Science, pp.196-209, 2017.

M. , H. Et, and G. P. , «From recombination of genes to the estimation of distributions i. binary parameters», dans Parallel Problem Solving from NaturePPSN IV, pp.178-187, 1996.

N. , M. S. , and D. C. Araújo, «New heuristics for the no-wait flowshop with sequence-dependent setup times problem», Journal of the Brazilian Society of Mechanical Sciences and Engineering, vol.36, p.52, 2013.

N. , M. , E. E. Enscore, and I. H. , «A heuristic algorithm for the m-machine, njob flow-shop sequencing problem», Omega, vol.11, issue.83, p.50, 1983.

B. Hagan, S. , J. Knowles, and D. B. Kell, «Exploiting genomic knowledge in optimising molecular breeding programmes : Algorithms from evolutionary computing», PLoS ONE, vol.7, pp.48-862, 2012.

L. S. Oliveira, M. Morita, and R. Sabourin, «Feature selection for ensembles using the multi-objective optimization approach», dans Multi-Objective Machine Learning, vol.26, p.27, 2006.

P. , Q. , M. F. Tasgetiren, and Y. Liang, «A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem», Computers & Operations Research, vol.35, issue.9, p.22, 2008.

P. , Q. , L. Wang, M. F. Tasgetiren, and B. Zhao, «A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion», The International Journal of Advanced Manufacturing Technology, vol.38, p.22, 2007.

P. , Q. , L. Wang, and B. Zhao, «An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion», The International Journal of Advanced Manufacturing Technology, vol.38, pp.778-786, 2007.

P. , C. H. , and K. Steiglitz, Combinatorial optimization : algorithms and complexity, vol.12, 1982.

P. , T. , Z. Lin, and R. Altman, «Choosing SNPs using feature selection», dans 2005 IEEE Computational Systems Bioinformatics Conference (CSB'05), p.27, 2005.

P. , P. Et, and J. Hovovicova, «Novel methods for subset selection with respect to problem knowledge», IEEE Intelligent Systems, vol.13, issue.2, pp.66-74, 1998.

Q. , B. , L. Wang, R. Hu, D. Huang et al., «A DE-based approach to nowait flow-shop scheduling», Computers & Industrial Engineering, vol.57, pp.787-805, 2009.

R. and C. , «A no-wait flowshop scheduling heuristic to minimize makespan», The Journal of the Operational Research Society, vol.45, p.19, 1994.

R. , S. S. , and C. V. Ramamoorthy, «On the flow-shop sequencing problem with no wait in process ?», Journal of the Operational Research Society, vol.23, pp.323-331, 1972.

R. and J. R. , «The algorithm selection problem», dans Advances in Computers, Elsevier, pp.65-118, 1976.

H. Bibliographie-röck, «The three-machine no-wait flow shop is NP-complete», Journal of the ACM, vol.31, issue.2, p.17, 1984.

R. , R. Et, and T. Stützle, «A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem», European Journal of Operational Research, vol.177, p.92, 2007.

S. , H. Et, and T. Y. Elmekkawy, «A meta-heuristic approach for solving the no-wait flow-shop problem», International Journal of Production Research, vol.50, pp.7313-7326, 2012.

S. , L. F. , S. L. Martins, and A. Plastino, «Applications of the DM-GRASP heuristic : a survey», vol.15, p.46, 2008.

S. , D. Et, and N. Z. , «Solution methods for fuel supply of trains», INFOR : Information Systems and Operational Research, vol.51, p.46, 2013.

C. J. Schuster, «No-wait job shop scheduling : Tabu search and complexity of subproblems», Mathematical Methods of Operations Research, vol.63, pp.473-491, 2006.

C. J. Schuster and J. M. Framinan, «Approximative procedures for no-wait job shop scheduling», Operations Research Letters, vol.31, issue.03, pp.308-318, 2003.

S. , W. Et, and D. Hott, «A new formulation and solution of the flowshop scheduling problem with no in-process waiting», Applied Mathematical Modelling, vol.10, pp.246-248, 1986.

S. , R. F. , E. Castro, C. N. Gupta, M. Cetin et al., «The tenth annual MLSP competition : Schizophrenia classification challenge», dans 2014 IEEE International Workshop on Machine Learning for Signal Processing (MLSP), 2014.

S. , R. Et, and K. P. , «Differential evolution a simple and efficient heuristic for global optimization over continuous spaces», Journal of Global Optimization, vol.11, pp.341-359, 1997.

T. and E. , «Benchmarks for basic scheduling problems», European Journal of Operational Research, vol.64, issue.2, p.82, 1993.

O. Bibliographie-telelis, P. Et, and . Stamatopoulos, «Combinatorial optimization through statistical instance-based learning», dans Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI, 2001.

T. and L. Lin, «A hybrid genetic algorithm for no-wait flowshop scheduling problem», International Journal of Production Economics, vol.128, issue.1, pp.144-152, 2010.

W. , C. , X. Li, and Q. W. , «Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion», European Journal of Operational Research, vol.206, p.61, 2010.

W. , C. J. , and P. Dayan, «Q-learning», Machine Learning, vol.8, pp.279-292, 1992.

W. , D. C. , and D. B. Kell, «Rapid prediction of optimum population size in genetic programming using a novel genotype-», dans Proceedings of the 10th annual conference on Genetic and evolutionary computation-GECCO '08, vol.36, p.46, 2008.

W. and D. A. , «Solution of the flowshop-scheduling problem with no intermediate queues», Operations Research, vol.20, p.19, 1972.

W. and S. , The roles of mutation, inbreeding, crossbreeding, and selection in evolution, vol.1, 1932.

X. , B. , M. Zhang, and W. N. Browne, «Particle swarm optimization for feature selection in classification : A multi-objective approach», IEEE Transactions on Cybernetics, vol.43, issue.6, p.27, 2013.

Y. , J. , and V. Honavar, «Feature subset selection using a genetic algorithm», dans Feature Extraction, Construction and Selection, vol.26, p.27, 1998.

Y. and Z. , Learning-Driven Optimization Approaches for Combinatorial Search Problems, thèse de doctorat, UniversitAngers, p.30, 2017.

Z. , T. , P. Poupart, J. Kennedy, X. Jin et al., «Particle swarm optimization», dans Encyclopedia of Machine Learning, pp.760-766, 2011.

Z. , Y. , J. Hao, and B. Duval, «When data mining meets optimization : A case study on the quadratic assignment problem», p.36

Z. , Z. , Y. Ong, and M. D. , «Markov blanket-embedded genetic algorithm for gene selection», Pattern Recognition, vol.40, pp.3236-3248, 2007.

Z. , N. Et, and D. Schindl, «Learning tabu search for combinatorial optimization», p.105, 2015.