. Tab, 4 ? Comparaison entre PSE (pour des flow shops de permutation) et Algorithme Génétique (pour des flow shops généraux

A. H. Allaoui, A. Artiba, F. Riane, and S. E. Elmaghraby, 4 nous pouvons remarquer que l'algorithme de séparation et évaluation Bibliographie On the two machines flow shop with availability constraints, Du tableau 4 Proceedings for the International Conference on Industrial Engineering and production Management, 2003.

J. [. Adiri, E. Bruno, A. H. Frostig, and . Kan, Single machine flow-time scheduling with a single breakdown, Acta Informatica, vol.37, issue.7, pp.679-696, 1989.
DOI : 10.1007/BF00288977

E. [. Akturk and . Gorgulu, Match-up scheduling under a machine breakdown, European Journal of Operational Research, vol.112, issue.1, pp.81-97, 1999.
DOI : 10.1016/S0377-2217(97)00396-2

]. R. Agg01 and . Aggoune, Minimizing the makespan for the flow shop scheduling problem with availability constraints, Operational Research Peripatetic Post- Graduate Programme, 2001.

]. R. Agg02 and . Aggoune, Ordonnancement d'ateliers sous contraintes de disponibilité des machines, Thèse de doctorat, 2002.

J. [. Allahverdi and . Mittenthal, Dual criteria scheduling on a two-machine flowshop subject to random breakdowns, International Transactions in Operational Research, vol.5, issue.4, pp.317-324, 1998.
DOI : 10.1016/S0969-6016(97)00042-7

D. [. Akturk and . Ozdemir, An exact approach to minimizing total weighted tardiness with release dates Akturk and D. Ozdemir. A new dominance rule to minimize total weighted tardiness with unequal release dates, IIE Transactions European Journal of Operational research, vol.32, issue.135, pp.1091-1101394, 2000.

C. [. Abdul-razacq, L. N. Potts, and . Van-wassenhove, A survey of algorithms for the single machine total weighted tardiness scheduling problem, Discrete Applied Mathematics, vol.26, issue.2-3, pp.235-253, 1990.
DOI : 10.1016/0166-218X(90)90103-J

G. [. Albers and . Schmidt, Scheduling with unexpected machine breakdowns, Discrete Applied Mathematics, vol.110, issue.2-3, pp.85-99, 2001.
DOI : 10.1016/S0166-218X(00)00266-3

A. [. Ashayeri, W. Teelen, and . Selen, A production and maintenance planning model for the process industry, International Journal of Production Research, vol.40, issue.12, pp.3311-3326, 1996.
DOI : 10.1016/0377-2217(94)00261-A

]. K. Bak74 and . Baker, Introduction to sequencing and scheduling, 1974.

J. [. Baker and . Bertrand, A dynamic priority rule for scheduling against due-dates, Journal of Operations Management, vol.3, issue.1, pp.37-42, 1982.
DOI : 10.1016/0272-6963(82)90020-1

J. [. Banerjee and . Burton, Equipment utilization based maintenance task scheduling in a job shop, European Journal of Operational Research, vol.45, issue.2-3, pp.191-202, 1990.
DOI : 10.1016/0377-2217(90)90184-D

]. J. Bbf-+-01, J. Blazewicz, P. Breit, W. Formanowicz, G. Kubiak et al., Heuristic algorithms for the two-machine flowshop with limited machine availability, The International Journal of Management Science, vol.29, pp.599-608, 2001.

]. J. Bdf-+-00, M. Blazewicz, P. Drozdowski, W. Formanowicz, G. Kubiak et al., Scheduling preemptable tasks on parallel processors with limited availability, Parallel Computing, vol.26, pp.1195-1211, 2000.

]. M. Bem02 and . Bembla, Ordonnancement conjoint production et mainten ance : Critère et heuristique de résolution, Mémoire de dea, U.F.R des Sciences et Techniques de l'Université de Franche Comté, 2002.

M. [. Brandolese, A. Franci, and . Pozzetti, Production and maintenance integrated planning, International Journal of Production Research, vol.2, issue.7, pp.2059-2075, 1996.
DOI : 10.1080/00207548408942470

J. [. Blazewicz, A. H. Lenstra, and . Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Applied Mathematics, vol.5, issue.1, pp.11-24, 1983.
DOI : 10.1016/0166-218X(83)90012-4

URL : http://doi.org/10.1016/0166-218x(83)90012-4

A. [. Boucly and . Ogus, Le management de la maintenance, AFNOR, 1987.

]. A. Bou88 and . Boulenger, Vers le zéro panne avec la maintenance conditionnelle, Guides de l'utilisateur, 1988.

D. [. Blackstone, G. L. Phillips, and . Hogg, A state-of-the-art survey of dispatching rules for manufacturing job shop operations, International Journal of Production Research, vol.3, issue.1, pp.27-45, 1982.
DOI : 10.1080/00207547608956580

M. [. Boyer, E. Poirée, and . Salin, Précis d'organisation et de gestion de la production, 1986.

]. J. Bre00 and . Breit, Heuristische ablaufplanungsverfahren fur Flowshops und Openshops mit beschrankt verfugbaren prozessoren, 2000.

G. [. Breit, V. A. Schmidt, and . Strusevich, Two-machine open shop scheduling with an availability constraint, Operations Research Letters, vol.29, issue.2, pp.65-77, 2001.
DOI : 10.1016/S0167-6377(01)00079-7

G. [. Breit, V. A. Schmidt, and . Strusevich, Non-preemptive two-machine open shop scheduling with non-availability constraints, Project Management and Scheduling, 2002.
DOI : 10.1007/s001860200267

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

]. G. Cav00 and . Cavory, Une approche génétique pour la résolution d'ordonnancements cycliques, 2000.

P. [. Carlier and . Chrétienne, Problèmes d'ordonnancement, 1988.

Z. [. Chung and . Chen, Scheduling jobs and maintenance activities on parallel machines, Naval Research Logistics, vol.47, pp.145-165, 2000.

M. [. Colorni, V. Dorigo, and . Maniezzo, An investigation of some properties of an ant algorithm in parallel problem solving from nature 2, pp.509-520, 1991.

]. C. Chu92 and . Chu, A branch-and-bound algorithm to minimize total tardiness with different release dates, Naval Research Logistics, vol.3, issue.2, pp.265-283, 1992.
DOI : 10.1002/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L

]. C. Chu95 and . Chu, Ordonnancement de la production: approches théoriques nouvelles, 1995.

]. S. Coo71 and . Cook, The copmplexity of theorem proving procedures, Proceedings of the third annual ACM symposium on the theory of computing, pp.151-158, 1971.

]. T. Cou00 and . Coudert, Apport des systèmes muti-agents pour la négociation en ordonnancement : application aux fonctions production et maintenance, 2000.

]. J. Cp89a, E. Carlier, and . Pinson, An algorithm for solving the job shop problem, Management Science, vol.35, pp.164-176, 1989.

]. C. Cp89b, M. C. Chu, and . Portmann, Minimizing total tardiness for the one-machine scheduling problem, 1989.

M. [. Chu and . Portmann, Some new efficient methods to solve the n/1/ri/??Ti scheduling problem, European Journal of Operational Research, vol.58, issue.3, pp.404-413, 1992.
DOI : 10.1016/0377-2217(92)90071-G

H. [. Caux, M. C. Pierreval, and . Portmann, Les algorithmes génétiques et leurs applications aux problèmes d'ordonnancement. APII, pp.4-5409, 1995.

R. [. Della-croce, G. Tadei, and . Volta, A genetic algorithm for the job shop problem, 3rd International Workshop on PMS, 1992.
DOI : 10.1016/0305-0548(93)E0015-L

G. [. Cheng and . Wang, An improved heuristic for two-machine flowshop scheduling with an availability constraint, Operations Research Letters, vol.26, issue.5, pp.223-229, 2000.
DOI : 10.1016/S0167-6377(00)00033-X

]. L. Dav85 and . Davis, Job-shop scheduling with genetic algorithms, 1st Int. conf. on Genetic Algorithms and their applications, pp.136-140, 1985.

]. L. Dav91 and . Davis, Handbook of Genetic Algorithms, 1991.

]. S. Den99 and . Deniaud, Contribution à l'élaboration d'un modèle technico-économique de maintenance préventive. Cas de lignes de fabrication industrielles, UFR sciences et techniques de l'univesité de Franche-Comté, ENI de Belfort, 1999.

J. [. Du and . Leung, Minimizing Total Tardiness on One Machine is NP-Hard, Mathematics of Operations Research, vol.15, issue.3, pp.483-495, 1990.
DOI : 10.1287/moor.15.3.483

H. Emmons, One-Machine Sequencing to Minimize Certain Functions of Job Tardiness, Operations Research, vol.17, issue.4, pp.701-715, 1969.
DOI : 10.1287/opre.17.4.701

S. [. Falkenauer and . Bouffouix, A genetic algorithm for job shop, Proceedings. 1991 IEEE International Conference on Robotics and Automation, pp.824-829, 1991.
DOI : 10.1109/ROBOT.1991.131689

J. [. Fougerousse and . Germain, Pratique de la maintenance industrielle par le coût global. Afnor gestion, 1992.

]. D. Fog00 and . Fogel, Evolutionary Computation : Toward a new philosophy of machine intelligence, 2000.

]. L. Gen95 and . Geneste, Outils d'aide à la décision pour le pilotage d'atelier, 1995.

]. C. Git94 and . Gits, Structuring maintenance control systems, International Journal of Operations and Production Management, vol.14, issue.17, pp.5-17, 1994.

D. [. Garey and . Johnson, Computers and intractability : A guide of the theory of NP-completeness, W.H. freeman and Company, 1979.

C. [. Graves and . Lee, Scheduling maintenance and semiresumable jobs on a single machine, Naval Research Logistics, vol.6, issue.7, pp.845-863, 1999.
DOI : 10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#

E. [. Graham, J. K. Lawler, A. H. Lenstra, and . Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Descrete Mathematics, vol.5, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

]. F. Glo77 and . Glover, Heuristics for integer programming using surrogate constraints, Decision Sciences, vol.8, issue.1, pp.156-166, 1977.

]. F. Glo86 and . Glover, Future paths for integer programming and links to atificial intelligence, Computers and Operations Research, vol.13, pp.533-549, 1986.

]. D. Gol89 and . Golberg, Genetic algorithms in search, optimization and machine learning, 1989.

[. Gotha, Les problèmes d'ordonnancement. RAIRO-Recherche opérationnelle/ Operation research, pp.77-150, 1993.

Y. [. Gabriel and . Pimor, Maintenance assistée par ordinateur, 1985.

D. [. Guillaume, G. Rémy, and . Gilles, Une approche basée sur la simulation pour résoudre le problème du job shop périodique à contraintes linéaires, Proceedings of the 3td International Conference on Modelisation and simuling MOSIM, pp.199-203, 2001.

]. J. Hol75 and . Holland, Adaptation in natural and artifical systems, 1975.

]. J. Jac55 and . Jackson, Scheduling a production line to minimize maximum tardiness, 1955.

]. A. Jou02 and . Jouglet, Ordonnancer une machine pour minimiser la somme des coûts, 2002.

]. W. Kbf-+-02, J. Kubiak, P. Blazewicz, J. Formanowicz, G. Breit et al., Twomachine flow shops with limited machine availability, European Journal of Operational Research, vol.136, pp.528-540, 2002.

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

]. Y. Kim93 and . Kim, A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops, Computers & Operations Research, vol.20, issue.4, pp.391-401, 1993.
DOI : 10.1016/0305-0548(93)90083-U

B. [. Rinnooy-kan, J. K. Lageweg, and . Lenstra, Minimizing Total Costs in One-Machine Scheduling, Operations Research, vol.23, issue.5, pp.908-927, 1975.
DOI : 10.1287/opre.23.5.908

B. [. Kaspi and . Montreuil, On the scheduling of identical parallel processes with arbitrary initial processor available time, 1988.

C. [. Kaabi, N. Varnier, and . Zerhouni, Heuristics for scheduling maintenance and production on a single machine, IEEE International Conference on Systems, Man and Cybernetics, pp.6-9, 2002.
DOI : 10.1109/ICSMC.2002.1176339

J. Kaabi, C. Varnier, and N. Zerhouni, Ordonnancement de la production et de la maintenance Cas d'un atelier de type Flow Shop ?? deux machines, Journal Europ??en des Syst??mes Automatis??s, vol.37, issue.5, pp.641-660, 2003.
DOI : 10.3166/jesa.37.641-660

J. Kaabi, C. Varnier, and N. Zerhouni, Scheduling with machine availability : An integrated approach, Proc.of International conference on industrial Engineering and Production Management, IEPM'03, sur CD ROM, 7 pages, 2003.

C. [. Kaabi, N. Varnier, and . Zerhouni, Ordonnancement conjoint de la production et de la maintenance dans un flow shop, 5ème Conférence Francophone de Modélisation et Simulation, pp.1-3, 2004.

]. S. Las93 and . Lash, Genetic algorithms for weighted tardiness scheduling on parallel machines, 1993.

]. E. Law77 and . Lawler, A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness, Annals of Discrete Mathematics, vol.1, pp.331-342, 1977.

J. [. Lorigeon, J. L. Billaut, and . Bouquard, Availability constraint for a single machine problem with heads and tails, Project Management and Scheduling, 2002.

J. [. Li and . Cao, Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities, Operations Research Letters, vol.18, issue.2, pp.81-91, 1995.
DOI : 10.1016/0167-6377(95)00033-2

Z. [. Lee and . Chen, Scheduling jobs and maintenance activities on parallel machines, Naval Research Logistics, vol.3, issue.2, pp.145-165, 2000.
DOI : 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3

W. [. Liao and . Chen, Single-machine scheduling with periodic maintenance and nonresumable jobs Lee. Parallel machine scheduling with nonsimultaneous machine available time, Computers and Operations Research Discrete Applied Mathematics, vol.30, pp.53-61, 1991.
DOI : 10.1016/s0305-0548(02)00074-6

]. C. Lee96 and . Lee, Machine scheduling with an availability contraint, Journal of Global Optimization, vol.20, pp.395-416, 1996.

]. C. Lee97 and . Lee, Minimizing the makespan in two-machine flowshop scheduling problem with an availability constraint, Operations Research Letters, vol.20, pp.129-139, 1997.

]. C. Lee99 and . Lee, Two-machine flowshop scheduling problem with availability constraints, Lim91] S.D. Liman. Scheduling with capacities and due-dates. These de doctorat, pp.420-429, 1991.

T. [. Lee and . Kawa, A genetic algorithm for general machine scheduling problems, 1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111), pp.60-66, 1996.
DOI : 10.1109/KES.1998.725893

S. [. Lee and . Liman, Single machine flow-time scheduling with scheduled maintenance, Acta Informatica, vol.13, issue.4, pp.375-382, 1992.
DOI : 10.1007/BF01178778

S. [. Lee and . Liman, Capacitated two-parallel machines scheduling to minimize sum of job completion times, Discrete Applied Mathematics, vol.41, issue.3, pp.211-222, 1993.
DOI : 10.1016/0166-218X(90)90055-H

M. [. Lu and . Posner, An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity, Mathematics of Operations Research, vol.18, issue.1, pp.12-38, 1993.
DOI : 10.1287/moor.18.1.12

K. [. Lenstra, P. Rinnooy, . Brucker, E. Liu, and . Sanlaville, Complexity of machine scheduling problems Preemptive scheduling with variable profile, precedence constraints and due dates, Journal of Operational Research Society Discrete Applied Mathematics, vol.50, issue.58, pp.343-362253, 1977.

E. [. Lin, Y. Yao, and . He, Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times, Operations Research Letters, vol.22, issue.2-3, pp.75-81, 1998.
DOI : 10.1016/S0167-6377(97)00053-9

]. P. Lyo92 and . Lyonnet, La maintenance : mathématiques & méthodes, 1992.

]. D. Mat96 and . Mattfeld, Evolutionary search and the job shop. Investigations on genetic algorithms for production scheduling, 1996.

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

]. H. Mül93 and . Mülhenbein, Evolutionary Algorithms : Theory and Applications, 1993.

]. F. Mon87 and . Monchy, La fonction Maintenance : formation à la gestion de la maintenance industrielle. Collection technologies, 1987.

]. F. Mon03, . M. Monchymoo68-]-j, and . Moore, Maintenance : Méthodes et organisations An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science, vol.15, pp.102-109, 1968.

]. G. Mos94 and . Mosheiov, Minimizing the sum of job completion times on capacitated parallel machines, Mathl. Comput. Modelling, vol.20, pp.91-99, 1994.

P. [. Morton and . Ramnath, Guided Forward Search in Tardiness Scheduling of Large One Machine Problems, 1995.
DOI : 10.1007/978-1-4615-2263-8_4

]. S. Nak89, M. Nakajima, J. E. Nawaz, I. Enscore, and . Ham, La Maintenance Productive Totale (TPM). afnor gestion A heuristic algorithm for the m machine, n job flow shop sequencing problem, Omega, vol.11, 1983.

[. Pan, J. Chen, C. Chaopf97, . Jch, E. Pan et al., Minimizing tardiness in a two-machine flow-shop, Pin95] M. Pinedo. Scheduling Theory, Algorithms, and Systems, pp.869-885405, 1995.
DOI : 10.1016/S0305-0548(00)00090-3

W. [. Paz and . Leigh, Maintenance Scheduling: Issues, Results and Research Needs, International Journal of Operations & Production Management, vol.14, issue.8, pp.47-69, 1994.
DOI : 10.1108/01443579410067135

]. M. Por96 and . Portmann, Genetic algorithms and scheduling : a state of the art and some propositions, Proceedings of the workshop on production planning and control, pp.9-11, 1996.

T. [. Qi, F. Chen, and . Tu, Scheduling the maintenance on a single machine, Journal of the Operational Research Society, vol.50, issue.10, pp.1071-1078, 1999.
DOI : 10.1057/palgrave.jors.2600791

G. [. Qi, J. R. Yin, and . Birge, Single???machine scheduling with random machine breakdowns and randomly compressible processing times, Stochastic Analysis and Applications, vol.12, issue.4, pp.635-653, 2002.
DOI : 10.1016/0167-6377(91)90071-V

]. R. Rac87 and . Rachamadugu, A note on weighted tardiness problem, Operations Research, vol.35, pp.450-452, 1987.

D. [. Rishel and . Christy, Incorporating maintenance activities into production planning; integration at the master schedule versus material requirements level, International Journal of Production Research, vol.24, issue.2, pp.421-446, 1996.
DOI : 10.1016/0272-6963(86)90016-1

E. [. Russel, B. W. Dar-el, and . Taylor, A comparative analysis of the covert job sequencing rule using various shop, International Journal of Production research, vol.27, pp.1523-1540, 1986.

]. C. Ree95 and . Reeves, A genetic algorithm for flow shop sequencing, Computers and Research, vol.22, pp.5-14, 1995.

]. Roj97 and . Rojas, Résolution de problèmes de satisfaction de contraintes avec des algorithmes évolutionnistes, 1997.

B. [. Roy and . Sussmann, Les problèmes d'ordonnancement avec contraintes disjonctives. Note DS-9 bis, 1964.

K. [. Rodammer and . White, A recent survey of production scheduling, IEEE Transactions on Systems, Man, and Cybernetics, vol.18, issue.6, 1988.
DOI : 10.1109/21.23085

]. C. Sad02 and . Sadfi, Problèmes d'ordonnancement avec minimisation des encours, Thèse de doctorat, 2002.

]. Sch81 and . Schwefel, Numerical optimization of computer models, 1981.

]. G. Shm84 and . Shmidt, Scheduling on semi-identical processors, Z. Oper. Res, vol.28, pp.153-162, 1984.

]. G. Shm88 and . Shmidt, Scheduling independent tasks with deadlines on semi-identical processors, Shm00] G. Shmidt. Scheduling with limited machine availability, pp.271-2771, 1988.

]. W. Smi56 and . Smith, Various optimizers for single stage production, Naval Research Logistics Quarterly, vol.3, pp.59-66, 1956.

G. [. Sanlaville, . W. Schmidtss00-]-t, J. G. Sloan, and . Shanthikumar, Machine scheduling with availability constraints Combined production and maintenance scheduling for a multiple product, single machine production system, Production and Operation Management, vol.9, issue.4, pp.379-399, 1997.

]. G. Sys89 and . Syswarda, Uniform cross-over in genetic algorithms, Third International Conference on Genetic Algorithms, pp.2-9, 1989.

L. [. Taillard, M. Gambardella, J. Y. Gendreau, and . Potvin, Adaptive memory programming: A unified view of metaheuristics, European Journal of Operational Research, vol.135, issue.1, pp.1-16, 2001.
DOI : 10.1016/S0377-2217(00)00268-X

. P. Vm87-]-a, T. E. Vepsalainen, and . Morton, Priority rules for job shops with weighted tardiness costs, Management Science, vol.33, pp.1035-1047, 1987.

C. [. Weinstein and . Chung, Integrating maintenance and production decisions in a hierarchical production planning environment, Computers & Operations Research, vol.26, issue.10-11, pp.1059-1074, 1999.
DOI : 10.1016/S0305-0548(99)00022-2

J. [. Wang and . Xie, A hybrid Genetic Algorithm that adapts to binary and real coded operators Two-stage flexible flowshop scheduling with limited machine availability, The First International Conference on Information and Management Sciences, 1997.

J. [. Wang, Y. Xie-xu, N. Tian, and . Sannomiya, Branch and bound algorithm for flexible flowshop with limited machine availability Asian Information-Science-Life Three-stage tabu search for solving largescale flow shop scheduling problems, Transactions of Institute of Electrical Engineers of Japan, vol.1, issue.1233, pp.601-608, 2003.

]. G. Zwi96 and . Zwingelstein, La maintenance basée sur la fiabilité, Guide pratique d'application de la RCM, série Diagnostic et Maintenance, 1996.