S. Albers and P. Brucker, The complexity of one-machine batching problems, Discrete Applied Mathematics, vol.47, issue.2, pp.87-107, 1993.
DOI : 10.1016/0166-218X(93)90085-3

G. Ashish and D. Satchidananda, « Evolutionary Algorithms for Multi- Criterion Optimization: a Survey, International Journal of Computing & Information Sciences, vol.2, issue.1, pp.38-57, 2004.

E. Balas, J. K. Lenstra, and A. , The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling, Management Science, vol.41, issue.1, pp.94-109, 1995.
DOI : 10.1287/mnsc.41.1.94

E. Balas, « On the facial structure of scheduling polyhedral, Mathematical Programming Studies, vol.24, 1985.

V. Barichard, « Approches hybrides pour les problèmes multiobjectifs, Thèse de Doctorat, 2003.

N. Barnier and P. Brisset, « Optimisation par algorithme génétique sous contraintes, Technique et Science Informatique, vol.18, pp.1-29, 1999.

J. R. Barker and G. B. Mcmahon, Scheduling the General Job-Shop, Management Science, vol.31, issue.5, pp.594-598, 1985.
DOI : 10.1287/mnsc.31.5.594

H. Boukef, F. Tangour, M. Benrejeb, and P. Borne, « Nouveau codage pour la résolution de problèmes d'ordonnancement d'ateliers de type flow-shop par les algorithmes génétiques, STA'06, pp.1-14, 2006.

H. Boukef, F. Tangour, M. Benrejeb, and P. Borne, « Sur la formulation d'un problème d'ordonnancement de type flow-shop d'ateliers de production en industries pharmaceutiques, 2006.

P. Bratley, M. Floran, and P. Robillard, On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem, Naval Research Logistics Quarterly, vol.18, issue.1, pp.57-67, 1973.
DOI : 10.1002/nav.3800200106

P. Brucker and S. Knust, « Complexity results for single-machine problems with positive finish-start time-lags », Osnabruecker Schriftenzur, 1998.

P. Brucker, J. Hurink, B. Jurish, and B. Wöstman, A branch & bound algorithm for the open-shop problem, Discrete Applied Mathematics, vol.76, issue.1-3, pp.43-59, 1997.
DOI : 10.1016/S0166-218X(96)00116-3

P. Brucker, B. Jurisch, and B. , 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

A. Cabarbaye, « Outil générique d'optimisation par Algorithmes Génétiques et Simplexe », 8 èmes Journées Nationales du groupe Mode, mars, pp.23-25, 2000.

J. Carlier and I. , Rebaï, « Two exact methods for solving the permutation flow-shop problem, European Journal of Operational Research, pp.238-251, 1996.

J. Carlier and E. Pinson, Adjustment of heads and tails for the job-shop problem, European Journal of Operational Research, vol.78, issue.2, pp.146-161, 1994.
DOI : 10.1016/0377-2217(94)90379-4

J. Carlier and E. Pinson, An Algorithm for Solving the Job-Shop Problem, Management Science, vol.35, issue.2, pp.164-176, 1989.
DOI : 10.1287/mnsc.35.2.164

J. Carlier, The one-machine sequencing problem, European Journal of Operational Research, vol.11, issue.1, pp.42-47, 1982.
DOI : 10.1016/S0377-2217(82)80007-6

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

J. Carlier, P. Chrétienne, and C. Girault, « Modeling scheduling problems with timed Petri nets », Advances Studies in Petri Nets, Lecture Notes in Comp. Sci, 1984.

S. Cavalieri and P. Gaiardelli, « Hybrid genetic algorithms for a multiple-objective scheduling problem», Journal of Intelligent Manufacturing, vol.9, issue.4, pp.361-367, 1998.
DOI : 10.1023/A:1008935027685

F. Chauvet, E. Levner, and J. Proth, « On-line part scheduling in a surface treatment system, Journal of Operational Research, IJOR, vol.120, issue.2, 2000.

F. Chauvet, J. Proth, and Y. Wardi, « On-line scheduling with wip regulation, Proceedings of the Rensselaer International Conference on Agile, Intelligent, and Computer-Integrated Manufacturing, 1998.

R. Cheng, M. Gen, and Y. Tsujimura, A tutorial survey of job-shop scheduling problems using genetic algorithms???I. representation, Computers & Industrial Engineering, vol.30, issue.4, pp.983-997, 1996.
DOI : 10.1016/0360-8352(96)00047-2

. Coo71 and S. A. Cook, « The complexity of theorem proving procedures », Association of Computing Machinery, Proceedings of the third annual ACM Symposium on the Theory of Computing, pp.151-158, 1971.

D. Croce, F. , R. Tadei, and G. Volta, A genetic algorithm for the job shop problem, Computers & Operations Research, vol.22, issue.1, pp.15-24, 1995.
DOI : 10.1016/0305-0548(93)E0015-L

N. Dridi and J. M. Proth, « Ordonnancement des tâches : une méthode basée sur la technologie de groupe, Proceedings of the second International Conference on Production Systems, 1987.

C. Duron, « Ordonnancement en temps réel des activités des radars, Thèse de Doctorat, 2002.

. Bibliographie-[-fia98, A. Fiat, G. Woeginger, and J. Sgall, « Lectures Notes in Computer Science : On-line algorithms, the state of the art, pp.196-231, 1998.

M. L. Fisher, « The lagrangian relaxation method for solving integer programming problems, Management Science, vol.27, 1981.

M. L. Fisher, A dual algorithm for the one-machine scheduling problem, Mathematical Programming, pp.23-37, 1976.
DOI : 10.1007/BF01580393

C. Gagnié, M. Gravel, and W. L. Price, « Optimisation par colonies de fourmis pour un problème d'ordonnancement industriel avec temps de réglage dépendant de la séquence, 3ème Conférence Francophone de MOdélisation et de SIMulation, MOSIM'01, 2001.

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

M. Garey, R. L. Graham, and D. S. Johnson, Performance Guarantees for Scheduling Algorithms, Operations Research, vol.26, issue.1, pp.3-21, 1978.
DOI : 10.1287/opre.26.1.3

. Gar01, E. Gargouri, S. Hammadi, and P. Borne, « New constraints of agro-food industry scheduling problem, Acte de IFDICON'2001, European Workshop on Intelligent Forecasting, pp.73-80, 2001.

A. M. Geoffrion, Lagrangian Relaxation for Integer Programming, Mathematical Programming Studies, vol.3, 1974.
DOI : 10.1007/978-3-540-68279-0_9

F. Ghedjati, Genetic algorithms for the job-shop scheduling problem with unrelated paralleled constraints: Heuristics mixing method machines and precedence, Computers and Industrial Engineering, vol.73, pp.39-42, 1999.

F. Ghedjati, « Résolution par des heuristiques dynamiques et des algorithmes génétiques du problème d'ordonnancement de type job-shop généralisé, Thèse de Doctorat, 1994.

C. Guéret, N. Jussien, and C. , Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems, European Journal of Operational Research, vol.127, issue.2, pp.344-354, 2000.
DOI : 10.1016/S0377-2217(99)00488-9

M. Gzara, « Méthode coopérative d'aide multicritère à l'ordonnancement flou, Thèse de Doctorat, 2001.

A. R. Hakan, G. Melhem, D. Mosse, and P. Mejia-alvarez, « Optimal reward-based scheduling of periodic real-time tasks, IEEE Real-Time Systems Symposium, pp.79-89, 1999.

J. H. Holland, « Adaptation in natural and artificial systems

J. K. Hao, P. Galinier, and M. Habib, « Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes, Intelligence Artificielle, vol.18, pp.1-63, 1999.

J. R. Jackson, « Scheduling a production line to minimize maximum tardiness, Research Report Management Science Research Report, vol.43, 1955.

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

A. K. Jain and H. A. , Single process plan scheduling with genetic algorithms, Production Planning & Control, vol.8, issue.4, pp.363-376, 1997.
DOI : 10.1080/095372897235172

A. Jouglet, P. Baptiste, and J. Carlier, Exact procedures for single machine total cost scheduling, IEEE International Conference on Systems, Man and Cybernetics, pp.2-3, 2002.
DOI : 10.1109/ICSMC.2002.1175623

I. Kacem, « Ordonnancement multicritère des job-shops flexibles : formulation, bornes inférieures et approche évolutionniste coopérative, Thèse de Doctorat, 2003.

S. Kirkpatrick, C. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Optimisation by simulated annealing, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

S. Kobayashi, I. Ono, and M. Yamamura, « An efficient genetic algorithm for job-shop scheduling problems, Proceeding of 6 th International Conference on Genetic Algorithms, pp.506-511, 1995.

E. L. Lawler, J. K. Lenstra, A. H. Rinnooy-kan, and D. Shmoys, « The Travelling Salesman Problem : A Guided Tour of Combinatorial Optimization, Lem91] Lemonias H., « Ordonnancement d'Atelier à Tâches : Une Approche par Décomposition Thèse de Doctorat, 1987.

J. K. Lenstra, A. H. Rinnooy-kan, and P. Bruker, Complexity of Machine Scheduling Problems, Complexity of machine scheduling problems, pp.343-362, 1977.
DOI : 10.1016/S0167-5060(08)70743-X

N. Liouane, I. Saad, S. Hammadi, and P. Borne, Ant systems & Local Search Optimization for flexible Jop shop Scheduling Production, International Journal of Computers Communications & Control, vol.2, pp.2-174, 2007.

N. Liouane, « Contribution à l'élaboration d'un outil d'aide à la décision pour l'ordonnancement de production en environnement incertain, Thèse de Doctorat, 1998.

G. B. Mcmahon and M. Florian, On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness, Operations Research, vol.23, issue.3, pp.475-482, 1975.
DOI : 10.1287/opre.23.3.475

P. Martin and D. B. , Shmoys, « A new approach to computing optimal schedules for the job-shop scheduling problem, the 5 th International IPCO Conference, pp.389-403, 1996.

P. Mauguière, Étude de problèmes d'ordonnancement disjonctifs avec contraintes de disponibilité des ressources et de préparation, Thèse de Doctorat, 2004.

K. Mesghouni, « Application des algorithmes évolutionnistes dans les problèmes d'optimisation en ordonnancement de la production, Thèse de Doctorat, 1999.

A. Mok, « Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment, 1983.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

R. Nakano and T. Yamada, « Conventional genetic algorithm for job shop problems, Proceedings of the fourth International Conference on Genetic Algorithms, pp.474-479, 1991.

E. Nowicki, An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times, European Journal of Operational Research, vol.72, issue.1, pp.74-82, 1994.
DOI : 10.1016/0377-2217(94)90331-X

A. J. Orman, Modelling for the control of a complex radar system, Computers & Operations Research, vol.25, issue.3, pp.239-249, 1998.
DOI : 10.1016/S0305-0548(97)00047-6

S. S. Panwalkar and R. Rajagopalan, Single-machine sequencing with controllable processing times, European Journal of Operational Research, vol.59, issue.2, pp.298-302, 1992.
DOI : 10.1016/0377-2217(92)90144-X

. Bibliographie, Penz, « Constructions agrégatives d'ordonnancements pour des job-shops statiques, dynamiques et réactifs, Thèse de Doctorat, 1994.

C. N. Potts, Technical Note???Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times, Operations Research, vol.28, issue.6, pp.1436-1441, 1980.
DOI : 10.1287/opre.28.6.1436

C. N. Potts, An adaptive branching rule for the permutation flow-shop problem, European Journal of Operational Research, vol.5, issue.1, pp.19-25, 1980.
DOI : 10.1016/0377-2217(80)90069-7

L. Scharge, « Obtaining optimal solutions to resource constrained net-work scheduling problems», 1971.

H. Tamaki, « Maintenance of diversity in a genetic algorithm and application to the job shop scheduling, Proceedings IMACS/SICE Int Symp On MRP2, pp.869-869, 1992.

F. Tangour and I. Saad, Multiobjective Optimization Scheduling Problems by Pareto-optimality in Agro-alimentaryWorkshop, International Journal of Computers Communications & Control, vol.1, issue.3, pp.71-83, 2006.
DOI : 10.15837/ijccc.2006.3.2296

F. Tangour and P. , Borne, « Ordonnancement des opérations dans un atelier de production agroalimentaire en minimisant le coût », Revue e-STA, 2006.

F. Tangour, S. Hammadi, P. Borne, and M. Benrejeb, « Cost optimal scheduling in an agro-food production workshop », Journal of Systems Science and Systems Engineering JSSSE

C. Terrioux, Approches structurelles et coopératives pour la résolution des problèmes de satisfaction de contraintes, Thèse de Doctorat, 2002.

P. Vacher, « Un système adaptatif par agents avec utilisation des algorithmes génétiques multi-objectifs : Application à l'ordonnancement d'atelier de type job-shop, Thèse de Doctorat, 2000.

C. Wang, Y. , and L. Kwei-jay, « Implementing a general realtime scheduling framework in the RED-Linux real-time kernel, IEEE Real-Time Systems Symposium, pp.246-255, 1999.

T. Yamada, « Studies on Metaheuristics for Job-shop and Flow-shop Scheduling Problems, 2003.

T. Yamada and R. Nakano, « A genetic algorithm applicable to large-scale job-shop problem », Parallel problem solving from nature, Editeur R.Männer and B. Manderick, Amesterdam, vol.2, pp.281-290, 1992.

N. Zribi, Ordonnancement dans un job-shop flexible sous contraintes de disponibilit?? des machines, Thèse de Doctorat, 2005.
DOI : 10.3166/jesa.41.651-671