B. Bibliographie-112, . E. Alba, A. J. Alba, J. M. Nebro, and . Troya, Heterogeneous computing and parallel genetic algorithms, Journal of Parallel Distributed Computing, vol.65, pp.1362-1385, 2002.

. H. Altay and . Altay, A genetic algorithm for multicriteria inventory classification, Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, pp.6-9, 1995.

M. Andresen, H. Bräsel, M. Mörig, J. Tusch, F. Werner et al., Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, Mathematical and Computer Modelling, vol.48, issue.7-8, pp.1279-1293, 2008.
DOI : 10.1016/j.mcm.2008.01.002

R. Armentano and . Mazzini, A genetic algorithm for scheduling on a single machine with set-up times and due dates, Production Planning & Control, vol.11, issue.7, pp.713-720, 2002.
DOI : 10.1080/095372800432188

. P. Baptiste, C. L. Baptiste, and . Pape, A constraint-Based Branch and Bound Algorithm for Preemptive Job-Shop Scheduling, th IEEE, International Symposium on Assembly and Task Planning, 1996.

G. Bel and J. B. Cavaillé, Ordonnancement de la production, Editions Hermès, 2001.

. R. Bellman and . Bellman, The Bellman continum, Editions Robert S. Roth, 1986.

. J. Blazewicz, K. Blazewicz, E. Ecker, G. Pesch, J. Schmidt et al., Scheduling computer and manufacturing process [Borne, 07] P. Borne, F. Tangour, Metaheuristics for the optimization in planning and scheduling. Conférence plénière, MCPL2007 IFAC conférence, Proc. T1 Septembre 2007. [Borne, 10] P. Borne, M. Benrejeb, pp.1-8, 1996.

M. Benrejeb and P. Borne, Genetic Algorithm and Particle Swarm Optimization comparison for solving a flow-shop multiobjective scheduling problem, International Review of Automatic Control (IREACO), vol.2, pp.2-223, 2009.

A. Huntley and . Spillane, A parallel genetic heuristic for the quadratic assignment problem, 3rd International Conference on Genetic Algorithms, pp.406-415, 1989.

. P. Brucker, B. Brucker, B. Jurisch, and . Sievers, A branch and bound algorithm for the job-shop scheduling problem, Discrete Applied Mathematics, vol.49, issue.1-3, pp.107-127, 1994.
DOI : 10.1016/0166-218X(94)90204-6

. Cantú-paz, Cantú-Paz, A survey of parallel genetic algorithms, Calculateurs Parallèles, Réseaux et Systems Repartis, vol.10, issue.2, pp.141-171, 1998.

. E. Cantú-paz, D. E. Cantú-paz, and . Goldberg, Efficient parallel genetic algorithms: theory and practice, Computer Methods in Applied Mechanics and Engineering, vol.186, issue.2-4, pp.221-238, 2000.
DOI : 10.1016/S0045-7825(99)00385-0

. J. Carlier and . Carlier, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, European Journal of Operational Research, vol.29, issue.3, pp.298-306, 1987.
DOI : 10.1016/0377-2217(87)90243-8

. J. Carlier and . Carlier, Problèmes d'ordonnancement à contraintes de ressources : algorithmes et complexité, Thèse de Doctorat, 1984.

. P. Chang, J. C. Chang, C. H. Hsieh, and . Liu, A case-injected genetic algorithm for single machine scheduling problems with release time, International Journal of Production Economics, vol.103, issue.2
DOI : 10.1016/j.ijpe.2005.11.003

. P. Chang, S. H. Chang, C. H. Chen, and . Liu, Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems, Expert Systems with Applications, vol.33, issue.3, pp.762-771, 2007.
DOI : 10.1016/j.eswa.2006.06.019

. P. Chang, S. S. Chang, C. Y. Chen, and . Fan, Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems, Applied Soft Computing, vol.8, issue.1, pp.767-777, 2008.
DOI : 10.1016/j.asoc.2007.06.005

]. I. Charon, A. Germa, and O. Hudry, Méthodes d'optimisation combinatoire, 1996.

A. Chipperfield and P. Fleming, Parallel genetic algorithms. Parallel and Distributed Computing Handbook, Bibliographie, vol.115, pp.1118-1143, 1996.

E. Choobineh, H. Mohebbi, and . Khoo, A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times, European Journal of Operational Research, vol.175, issue.1, pp.318-337, 2006.
DOI : 10.1016/j.ejor.2005.04.038

. C. Chu and J. Chu, Proth, L'ordonnancement et ses applications, 1996.

M. A. Colorni, V. Dorigo, and . Maniezzo, Distributed Optimization by Ant Colonies, Proceedings of the First European Conference on Artificial Life, pp.134-142, 1991.

M. A. Colorni, V. Dorigo, and . Maniezzo, An Investigation of some Properties of an Ant Algorithm, Proceedings of the Parallel Problem Solving from Nature Conference (PPSN 92), pp.509-520, 1992.

]. K. Deb, Multi-Objective Optimization using Evolutionary Algorithms, 2001.

D. I. Falco, R. De-falco, E. Del-balio, R. Tarantino, and . Vaccaro, Improving search by incorporating evolution principles in parallel Tabu Search, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, pp.823-828, 1994.
DOI : 10.1109/ICEC.1994.349949

. I. De-falco, R. De-falco, E. Del-balio, and . Tarantino, An analysis of parallel heuristics for task allocation in multicomputers, Computing, vol.69, issue.3, pp.259-275, 1995.
DOI : 10.1007/BF02684444

M. Dorigo and L. M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.53-66, 1997.
DOI : 10.1109/4235.585892

. J. Dréo, A. Dréo, P. Pétrowski, E. Siarry, and . Taillard, Métaheuristiques pour l'optimisation difficile, Editions Eyrolles, 2003.

A. Drira, S. Hajri-gabouj, and A. B. Amor, Approche Pareto de recuit simulé pour la résolution d'un problème industriel d'ordonnancement à une machine, pp.2-04, 2008.

. N. Durand, J. M. Durand, J. Alliot, and . Noailles, Algorithmes génétiques, un croisement pour les problèmes partiellement séparables, Journées Evolution Artificielle Francophones JEAF, 1994.

. A. Fallahi, C. Fallahi, R. W. Prins, and . Calvo, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Computers & Operations Research, vol.35, issue.5, pp.1725-1741, 2008.
DOI : 10.1016/j.cor.2006.10.006

S. Ekúio÷lu, P. Duni-ekúio÷lu, and . Jain, A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods

O. Etiler, B. Toklu, M. Atak, and J. Wilson, A genetic algorithm for flow shop scheduling problems, Journal of the Operational Research Society, vol.31, issue.8, pp.830-835, 2004.
DOI : 10.1016/S0305-0483(03)00047-1

A. Ferland, Genetic hybrids for the quadratic assignment problem, DIMACS Series in discrete Mathematics and Theoretical Computer Science, vol.16, pp.173-188, 1994.

. L. Franchini, E. Franchini, G. Caillaud, P. Lacoste, and . Nguyên, Planning and scheduling skills: a case study in an agri-food industry, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), 1998.
DOI : 10.1109/ICSMC.1998.725447

9. M. Fonseca, J. Fonseca, and . Peter, An Overview of Evolutionary Algorithms in Multiobjective Optimization, Evolutionary Computation, vol.3, issue.1, pp.1-16, 1995.
DOI : 10.1162/evco.1994.2.3.221

. M. Garey, D. Garey, and . Johnson, Computer and Intractability: a Guide to the Theory of NP-Completeness, 1979.

. E. Gargouri, S. Gargouri, P. Hammadi, and . Borne, Analyze of reactive schedule in agro-food chain, JTEA, 2 ème Conférence Internationale, 21-23 Mars, pp.312-319, 2002.

. E. Gargouri and . Gargouri, Ordonnancement coopératif en industries agroalimentaires, Thèse de Doctorat, Université des Sciences et Technologies de Lille 1, 2003.

. F. Glover and . Glover, Tabu search, part I. ORSA, Journal of Computing, vol.1, pp.190-206, 1989.
DOI : 10.1287/ijoc.1.3.190

. F. Glover and . Glover, Tabu Search???Part II, ORSA Journal on Computing, vol.2, issue.1, pp.4-32, 1990.
DOI : 10.1287/ijoc.2.1.4

. F. Glover, T. Glover, and . Thresholding, Tabu Thresholding: Improved Search by Nonmonotonic Trajectories, ORSA Journal on Computing, vol.7, issue.4, pp.426-442, 1995.
DOI : 10.1287/ijoc.7.4.426

. F. Glover, M. Glover, and . Laguna, Tabu search, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01389283

. D. Goldberg, J. Goldberg, and . Richardson, Genetic algorithms with sharing for multimodal function optimization, 2nd International Conference on Genetic Algorithms, pp.41-49, 1987.

. G. Goldberg and . Goldberg, Algorithmes génétiques, 1994.

. D. Goldberg and . Goldberg, The Design of Innovation, Technological Forecasting and Social Change, vol.64, issue.1, pp.7-12, 2000.
DOI : 10.1016/S0040-1625(99)00079-7

S. Nakamura and . Tamaki, Parallel genetic algorithms on line topology of heterogeneous computing resources, Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pp.1447-1454, 2005.

A. Gupta, A. Gupta, and . Kumar, Minimizing flow time variance in a single machine system using genetic algorithms, European Journal of Operational Research, vol.70, issue.3, pp.289-303, 1993.
DOI : 10.1016/0377-2217(93)90240-N

. I. Harbaoui, R. Harbaoui, M. Kammarti, P. Ksouri, and . Borne, A genetic algorithm for the multi-pickup and delivery problem with time windows, Studies in Informatics and Control, vol.18, pp.2-173, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00521138

M. Hassine, N. Liouane, and K. B. Othman, Elaboration d'une métaheuristique d'aide à l'ordonnancement. La 5 ème Conférence Internationale d'Electrotechnique et d, pp.2-04, 2008.

H. He, O. Sýkoraa, A. Salagean, and E. Mäkinen, Parallelisation of genetic algorithms for the 2-page crossing number problem, Journal of Parallel and Distributed Computing, vol.67, issue.2, pp.229-241, 2007.
DOI : 10.1016/j.jpdc.2006.08.002

. J. Holland and . Holland, Adaptation in natural and artificial systems, Ann Arbor, 1975.

A. Hwang and . Masud, Multiple objective decision making -methods and applications, Lectures Notes in Economics and Mathematical Systems, 1979.
DOI : 10.1007/978-3-642-45511-7

S. K. Iyer and B. Saxena, Improved genetic algorithm for the permutation flowshop scheduling problem, Computers & Operations Research, vol.31, issue.4, pp.593-606, 2004.
DOI : 10.1016/S0305-0548(03)00016-9

]. A. Jain and S. Meeran, Deterministic job-shop scheduling: Past, present and future, European Journal of Operational Research, vol.113, issue.2, pp.2-390, 1999.
DOI : 10.1016/S0377-2217(98)00113-1

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.9979

]. T. James, C. Rego, and F. Glover, A cooperative parallel tabu search algorithm for the quadratic assignment problem, European Journal of Operational Research, vol.195, issue.3, pp.810-826, 2009.
DOI : 10.1016/j.ejor.2007.06.061

S. Jin, C. Song, and . Wu, A simulated annealing algorithm for single machine scheduling problems with family setups, Computers & Operations Research, vol.36, issue.7
DOI : 10.1016/j.cor.2008.08.001

I. Kacem, S. Hammadi, and P. Borne, Pareto-optimality for flexible jobshop scheduling problem: hybridization of genetic algorithm with fuzzy logic, erations Research, pp.2133-2138, 2002.

. R. Kammarti, S. Kammarti, P. Hammadi, M. Borne, and . Ksouri, Special Tabu Search in an Hybrid Evolutionary Approach for the PDPTW, SCI IEEE International Conference, 2005.

. R. Kammarti and . Kammarti, Approches évolutionnistes pour la résolution du 1- PDPTW statique et dynamique, Thèse de Doctorat, 2006.

A. Karray, M. Benrejeb, and P. Borne, Algorithmes Génétiques Séquentiel pour la résolution de problèmes d'ordonnancement en industries agroalimentaires. Revue électronique Sciences et Technologies de l'Automatique e-STA, p.1, 2011.

A. Karray, M. Benrejeb, and P. Borne, New parallel genetic algorithms for the single-machine scheduling problems in agro-food industry, 2011 International Conference on Communications, Computing and Control Applications (CCCA)
DOI : 10.1109/CCCA.2011.6031216

URL : https://hal.archives-ouvertes.fr/hal-00717000

A. Karray, M. Benrejeb, and P. Borne, A hybrid method based on genetic algorithms and tabu search for the single-machine scheduling problem in agro-food industry, International Review of Automatic Control (IREACO), vol.4, p.2, 2011.

. S. Kirkpatrick, C. D. Kirkpatrick, M. P. Jr, and . Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

M. Koksalan and A. B. Keha, Using genetic algorithms for single-machine bicriteria scheduling problems, European Journal of Operational Research, vol.145, issue.3, pp.543-556, 2003.
DOI : 10.1016/S0377-2217(02)00220-5

. E. Köktener, M. Köktener, and . Koksalan, A simulated annealing approach to bicriteria scheduling problems on a single machine, Journal of Heuristics, vol.6, issue.3, pp.311-327, 2000.

. J. Lenstra, A. H. Lenstra, P. Rinnooy-kan, and . Bruker, Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, vol.1, pp.343-362, 1977.
DOI : 10.1016/S0167-5060(08)70743-X

[. C. Pape and . Pape, Three mechanisms for managing resource constraints in a library for constraint-based scheduling, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation ETFA 95 ETFA-95, pp.980-995, 1995.
DOI : 10.1109/ETFA.1995.496781

. I. Lerman, F. Lerman, and . Ngouenet, Algorithmes génétiques séquentiels et parallèles pour une représentation affine des proximités, 1995.

. C. Liaw and . Liaw, A tabu search algorithm for the open shop scheduling problem, Computers & Operations Research, vol.26, issue.2, pp.109-126, 1999.
DOI : 10.1016/S0305-0548(98)00056-2

. A. Madureira, C. Madureira, S. D. Ramos, and . Sliva, A GA based scheduling system for dynamic single machine problem, Proceedings of the 2001 IEEE International Symposium on Assembly and Task Planning (ISATP2001). Assembly and Disassembly in the Twenty-first Century. (Cat. No.01TH8560), pp.28-129, 2001.
DOI : 10.1109/ISATP.2001.929000

. M. Mayer and . Mayer, A network parallel genetic algorithm for the one machine sequencing problem, Computers & Mathematics with Applications, vol.37, issue.3, pp.71-78, 1999.
DOI : 10.1016/S0898-1221(99)00047-4

. K. Mesghouni, S. Mesghouni, P. Hammadi, and . Borne, On modeling genetic algorithm for flexible job-shop scheduling problems, Studies in Informatics and Control, vol.7, pp.1-37, 1998.

. K. Mesghouni and . Mesghouni, Application des algorithmes évolutionnistes dans les problèmes d'optimisation en ordonnancement de la production

K. Mesghouni, S. Hammadi, and P. Borne, Evolutionary algorithms for job-shop scheduling, International Journal of Applied Mathematics and Computer Science, vol.14, pp.1-91, 2004.

A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of State Calculations by Fast Computing Machines, J. Chem. Phys, vol.21, issue.6, pp.1087-1092, 1953.

A. Nakib, H. Oulhadj, and P. Siarry, Segmentation optimale d'image par recuit simulé, Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'06), pp.6-8

C. D. Porumbel, J. K. Hao, and P. Kuntz, Position guided tabu search for graph coloring, Selected Papers from the International Conference on Learning and Intelligent Optimization, pp.148-162, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00421659

. R. Ruiz, J. C. Ruiz, C. García-díaz, and . Maroto, Considering scheduling and preventive maintenance in the flowshop sequencing problem, Computers & Operations Research, vol.34, issue.11, pp.3314-3330, 2007.
DOI : 10.1016/j.cor.2005.12.007

M. Sakarovitch, Graphes et Programmation Linéaire, Edition Hermann, 1984.

]. R. Saldanha, Optimisation en électromagnétisme par application conjointe des méthodes de programmation non linéaire et de la méthode des éléments finis, Thèse de Doctorat, 1992.