E. H. Bibliographie-Ë1ë-aarts, P. J. Van-laarhoven, J. K. Lenstra, and N. L. Et-ulder, í A computational study of local search algorithms for job shop scheduling, ORSA Journal on Computing, vol.6, issue.2, 1994.

J. Adams, E. Balas, and D. Et-zawack, The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science, vol.34, issue.3, 1988.
DOI : 10.1287/mnsc.34.3.391

I. Ë3ë-adiri and N. Et-hefetz, í An eaecient algorithm for the twomachine , unit-time, job-shop schedule length problem, Mathematics of Operations Research, vol.7, 1982.

L. M. Aguilera, L. M. Aguilera, B. Penz, H. Song, and Z. Et-binder, í Ordonnancement de Production avecCo^ uts de Changements, Th ese de PhD, Institut National Polytechnique de Grenoble, INPG. í Design and implementation of a scheduling software system. In : System , Man and Cybernetics Conference, 1993.

S. B. Akers, í A graphical approach to production scheduling problems, ë7ë Appelgate D.. et Cook W... í A computational study of jobshop scheduling, 1956.

S. Ë8ë-ashour, K. Y. Chiu, and T. E. Et-moore, An optimal schedule time of a job shop-like disjunctive graph, 146 BIBLIOGRAPHIE ë9ë Baker K. R... í Introduction to Sequencing and Scheduling.í Wiley, 1973.
DOI : 10.1002/net.3230030405

E. Balas, Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm, Operations Research, vol.17, issue.6, 1969.
DOI : 10.1287/opre.17.6.941

E. Balas, On the facial structure of scheduling polyhedra, Mathematical Programming Studies, vol.24, 1985.
DOI : 10.1007/BFb0121051

J. R. Barker and G. B. Et-mcmahon, Scheduling the General Job-Shop, ë13ë Bellman R... í Dynamic Programming, 1957.
DOI : 10.1287/mnsc.31.5.594

E. Bensana, J. Blackstone, D. Phillips, and G. Et-hogg, IntelligenceA rtiaecielle pour l'Ordonnancement d'Atelier.í Th ese de PhD, Ecole Nationale Sup erieure de l'A eronautique et de l'Espace. í A state-of-theart survey of dispatching rules for manufacturing job-shop operations programming formulations for machine scheduling: A survey, International Journal of Production Research ë16ë Blazewicz J.., Dror M.. et Weglarz J... í Mathematical European Journal of Operational Research, vol.20, issue.51, 1982.

J. Blazewicz, K. Ecker, G. Schmidt, J. Et-weglarz, J. Blazewicz et al., í Scheduling in aeexible manufacturing systems, í Scheduling tasks and vehicles in a aeexible manufacturing system. International Journal of aeexible manufacturing systems, 1991.

R. W. Bouma and J. Scheduling, A Comparison of three Enumeration Schemes in a Branch and Bound Approach, 1982.

E. H. Bowman and C. R. Et-white, í The schedule sequencing problem. í An algorithm for aending optimal or near optimal solution to the production scheduling problem, Operations Research Journal of Industrial Ingineering, vol.7, issue.16 1, 1959.

P. Ë22ë-brucker, í An eaecient algorithm for the job-shop problem with two jobs, Computing, vol.40, 1988.

P. Ë23ë-brucker and B. Et-jurisch, A new lower bound for the job-shop scheduling problem, Second International Workshop on Project Management and Scheduling, EURO WG-PMS, 1990.
DOI : 10.1016/0377-2217(93)90174-L

P. Ë24ë-brucker and R. Et-schlie, í Job-shop scheduling with multipropose machine, Computing, vol.45, 1990.

J. Ë26ë-carlier, í One machine problem, European Journal of Operational Research, vol.11, 1982.

J. Ë27ë-carlier, í Probl emes d'Ordonnancements ac ontraintes de Ressources : Algorithmes et Complexit e.í Th ese d' etat, 1984.

J. Ë28ë-carlier and E. Et-pinson, í An algorithm for solving the jobshop problem, Management Science, vol.35, 1989.

J. Ë29ë-carlier and E. Et-pinson, í A practical use of jackson's preemptiveschedule for solving the job-shop problem, Annals of Operations Research, vol.26, 1990.

R. W. Conway, W. L. Maxwell, and L. W. Et-miller, í Theory of scheduling, 1967.

R. Ë31ë-cuninghame-green, í Minimax Algebra, 1979.
DOI : 10.1007/978-3-642-48708-8

E. Ë41ë-falkenauer and S. Et-bouaeouix, í A genetic algorithm for jobshop, IEEE International ConferenceonRobotics and Automation, 1991.

M. L. Fisher, í Optimal solution of scheduling problems using lagrange multipliers : Part 1, Operations Research, vol.21, 1973.

M. L. Fisher, í Optimal solution of scheduling problems using lagrange multipliers : Part 2, Symposium on the Theory of Scheduling and its Applications, 1973.

M. L. Fisher, A dual algorithm for the one-machine scheduling problem, Mathematical Programming, vol.18, issue.3, 1976.
DOI : 10.1007/BF01580393

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

M. L. Fisher, B. J. Lageweg, J. K. Lenstra, A. H. Et-rinnooy-kan, M. Florian et al., í Surrogate duality relaxation for job-shop scheduling í An implicitenumeration algorithm for the machine sequencing problem, Discrete Applied Mathematics Management Science, vol.5, issue.12, 1971.

S. French, í Sequencing and Scheduling : An Introduction to the Mathematics of the Job-Shop, 1982.

M. R. Garey, D. S. Johnson, and R. Et-sethi, í The complexity of aeow-shop and job-shop scheduling, Mathematics of Operations Research, vol.1, 1976.

E. S. Gee and C. H. Smith, Selecting allowance policies for improved job shop performance, International Journal of Production Research, vol.23, issue.8, 1993.
DOI : 10.1080/00207549308956826

A. M. Ë52ë-geoaerion, í Lagrangean relaxation for integer programming, Mathematical Programming Studies, vol.3, 1974.

R. Ë53ë-giaeer and G. L. Et-thompson, í Algorithms for solving production scheduling problems, Operations Research, vol.8, issue.4, 1960.

F. Glover, í Tabu search, part 1, ORSA Journal on Computing, vol.1, issue.3, 1989.

F. Glover, í Tabu search, part 2, ORSA Journal on Computing, vol.2, issue.1, 1990.

T. Gonzalez and S. Et-sahni, í Flow-shop and job-shop scheduling : Complexity and approximation, Operations Research, vol.26, 1978.

. Gotha, í Les probl emes d'ordonnancement, RAIRO-RO, vol.27, issue.1, 1993.

M. Grí-otschel, L. Lovv-asz, and A. Et-schrijver, í Geometric Algorithms and Combinatorial Optimization, 1988.

A. Guinet and M. Et-legrand, í Reduction of job-shop problems to aeow-shop problems with precedence constraints, 1994.

A. C. Hax, D. Et-candea, M. Held, and R. M. Karp, í Production and inventory management .í Englewood Cliaes í A dynamic programming approach to sequencing problems, Journal of SIAM, 1962.

J. H. Holland, í Adaptation in Natural and Artiaecial Systems. í The University of, 1975.

J. Hopaeeld, í Neural networks and physical systems with emergent collective computational abilities, Proceeding of the National Academy of Science, 1969.

J. R. Jackson, í An extension of Johnson's results on job lot scheduling, Naval Research Logistic Quarterly, vol.3, issue.3, 1956.

S. M. Johnson, í Optimal two and three stage production schedules, Naval research Logistic Quarterly, vol.1, issue.1, 1954.

M. N. Karsiti, J. B. Cruz, and J. H. Et-mulligan, Simulation studies of multilevel dynamic job shop scheduling using heuristic dispatching rules, Journal of Manufacturing Systems, vol.11, issue.5, 1992.
DOI : 10.1016/0278-6125(92)90063-L

S. Kirkpatrick, S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, W. Kubiak et al., í Optimization by simulated annealing: Quantitative studies í Optimization by simulated annealing, Journal of Statistical Physics Science, vol.34, issue.220 ë69ë, 1983.

B. J. Lageweg, J. K. Lenstra, and A. H. Et-rinnooy-kan, Job-Shop Scheduling by Implicit Enumeration, Management Science, vol.24, issue.4, 1977.
DOI : 10.1287/mnsc.24.4.441

E. L. Lawler, J. K. Lenstra, R. Kan, A. H. Et-shmoys, and D. , edit e parr. í The Traveling Salesman Problem: A GuidedT our of Combinatorial Optimization, 1987.

E. L. Lawler and D. E. Wood, Branch-and-Bound Methods: A Survey, Operations Research, vol.14, issue.4, 1966.
DOI : 10.1287/opre.14.4.699

L. Gall, A. Et-roubellat, and F. , í Caract erisation d'un ensemble d'ordonnancements avec contraintes de ressources de type cumulatif, 1992.

H. Ë74ë-lemonias, í Ordonnancement d'Atelier aT^ aches : Une Approche par D ecomposition.í Th ese de PhD, 1991.

C. J. Liao and C. T. Et-you, An Improved Formulation for the Job-Shop Scheduling Problem, Journal of the Operational Research Society, vol.43, issue.11, 1992.
DOI : 10.1057/jors.1992.162

P. Lopez, J. Erschler, and P. Et-esquirol, í Ordonnancementde t^ aches sous contraintes : une approche energ etique, 1992.

H. R. Ë77ë-lourenn-co, í Local optimization and the job-shop scheduling problem, 1994.

A. S. Ë78ë-manne, í On the job-shop scheduling problem, Operations Research, vol.8, 1960.

H. Ë79ë-matsuo, C. J. Suh, and R. S. Sullivan, í A ControlledSearch SimulatedAnnealing Method for the General Job-Shop Scheduling Problem. í Rapport technique n 03-44-88, 1988.

W. S. Ë80ë-mc-culloch and W. H. Et-pitts, í A logical calculus of ideas immanent in nervous activity, Bulletin of Mathematical Biophysics, vol.3, 1943.

L. G. Ë81ë-mitten, í Branch and bound methods : General formulation and properties, Operations Research, vol.18, 1970.

R. Nakano and T. Et-yamada, í Conventional genetic algorithm for job-shop problems, Conference on Genetic Algorithms, 1991.

S. S. Panwalkar and W. Et-iskander, A Survey of Scheduling Rules, Operations Research, vol.25, issue.1, 1977.
DOI : 10.1287/opre.25.1.45

C. H. Papadimitriou and K. Et-steiglitz, í Combinatorial Optimization : Algorithms and Complexity, N.J, 1982.

B. Penz and L. Et-dupont, í New heuristics for the job-shop problem, International Conference on industrial Engineering and Production Management, 1993.

E. Ë87ë-pinson, í LePr obl eme de Job-Shop.í Th ese de PhD, 1988.

M. Ë88ë-portmann, í M ethodes de d ecomposition spatiale et temporelle en ordonnancement de la production, APII, vol.22, 1988.

C. N. Potts, Analysis of a linear programming heuristic for scheduling unrelated parallel machines, Discrete Applied Mathematics, vol.10, issue.2, 1985.
DOI : 10.1016/0166-218X(85)90009-5

M. Ë90ë-queyranne, M. Queyranne, and Y. Wang, í Structure of a simple scheduling polyhedron. í Single-machine scheduling polyhedra with precedence constraints, Mathematical Programming, 1991.

N. Ë92ë-raman and F. B. Talbot, í The job-shop tardiness problem : A decomposition approach, European Journal of Operational Research, vol.69, 1993.

R. Ë93ë-ramasesh, Dynamic job shop scheduling: A survey of simulation research, Omega, vol.18, issue.1, 1990.
DOI : 10.1016/0305-0483(90)90017-4

R. V. Rogers and K. P. Et-white, Algebraic, mathematical programming, and network models of the deterministic job-shop scheduling problem, IEEE Transactions on Systems, Man, and Cybernetics, vol.21, issue.3, 1991.
DOI : 10.1109/21.97463

F. Ë97ë-rosenblatt, Perceptron Simulation Experiments, Proceeding of the IRE, 1960.
DOI : 10.1109/JRPROC.1960.287598

B. Roy, B. A. Et-sussman, and V. V. Vidal, í Les Probl emes d'ordonnancement avecc ontraintes disjonctives.í Rapport technique n D. S. 9, SEMA, ë99ë Schwefel H.-P... í Numerische Optimierung von Computer- Modellen mittels der Evolutionsstrategie.í Birkhí auser Verlag, 1964.

V. A. Strusevitch, í Two machine super-shop scheduling problem í A dioid algebra approach for modeling the job-shop scheduling problem, Journal of Operational Research Society, vol.42, issue.6, 1991.

E. Taillard, Parallel Taboo Search Techniques for the Job Shop Scheduling Problem, ORSA Journal on Computing, vol.6, issue.2, 1994.
DOI : 10.1287/ijoc.6.2.108

P. J. Ë106ë-van-laarhoven, E. H. Aarts, J. K. Et-lenstra, R. Vancheeswaran, and M. A. Et-townsend, í Job-shop scheduling by simulated annealing í Two-stage heuristic procedure for scheduling job-shops, Operations Research Journal of Manufacturing Systems, vol.40, issue.12 4, 1992.

A. P. Vepsalainen and T. E. Et-morton, Priority Rules for Job Shops with Weighted Tardiness Costs, Management Science, vol.33, issue.8, 1987.
DOI : 10.1287/mnsc.33.8.1035

M. M. Vig and K. J. Dooley, Dynamic rules for due-date assignment, ë110ë Wagner H. M... í An integer linear programming model for machine scheduling. Naval Research Logistic Quarterly, 1959.
DOI : 10.1287/mnsc.25.4.363

L. M. Ë111ë-wein and B. C. Et, í A broader view of the job-shop scheduling problem í The impact of processing time knowledge on dynamic job-shop scheduling, Management Science ë112ë Wein L. M.. et Ou J... Management Science, vol.38, issue.8, 1991.

F. Werner and A. Et-winkler, Insertion techniques for the heuristic solution of the job shop problem, Discrete Applied Mathematics, vol.58, issue.2, 1991.
DOI : 10.1016/0166-218X(93)E0127-K

M. Ë114ë-widmer, í Job shop scheduling with tooling constraints: a tabu search approach, Journal of the Operational Research Society, vol.42, issue.1, 1991.

C. S. Zhang, P. F. Yan, and T. Et-chang, í Solving job-shop scheduling problem with priority using neural network. í, 1991.

D. N. Zhou, V. Cherkassky, T. R. Baldwin, and D. E. Et-olson, A neural network approach to job-shop scheduling, IEEE Transactions on Neural Networks, vol.2, issue.1, 1991.
DOI : 10.1109/72.80311