E. H. Aarts and V. Laarhoven, Statistical cooling: A general approach to combinatorial optimization problems, Philips J. Res, vol.40, issue.4, pp.193-226, 1985.

S. B. Akers and J. Friedman, A Non-Numerical Approach to Production Scheduling Problems, Journal of the Operations Research Society of America, vol.3, issue.4, pp.429-442, 1955.
DOI : 10.1287/opre.3.4.429

R. Alvarez-valdes, A heuristic to schedule flexible job-shop in a glass factory, European Journal of Operational Research, vol.165, issue.2, pp.525-534, 2005.
DOI : 10.1016/j.ejor.2004.04.020

E. J. Anderson, C. A. Glass, and C. N. Potts, Local Search in Combinatorial Optimization, Machine scheduling, pp.361-414, 1997.

D. Applegate and W. Cook, A Computational Study of the Job-Shop Scheduling Problem, ORSA Journal on Computing, vol.3, issue.2, pp.149-156, 1991.
DOI : 10.1287/ijoc.3.2.149

T. S. Arthanary and K. G. Ramaswamy, An extension of two machine sequencing problem, Opsearch, vol.8, pp.10-22, 1971.

S. Ashour, K. Y. Chiu, and T. E. Moore, An optimal schedule time of a job shop-like disjunctive graph, Networks, vol.18, issue.4, 1973.
DOI : 10.1287/mnsc.17.5.307

Z. A. Banaszak and B. H. Krogh, Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows, IEEE Transactions on Robotics and Automation, vol.6, issue.6, pp.724-734, 1990.
DOI : 10.1109/70.63273

D. Boumédiène-merouane-hocine and . Ali, Les Problèmes d'Ordonnancement à Machines Parallèles de Tâches Dépendantes : une Evaluation de Six Listes et d'un Algorithme Génétique. COSI06, colloque international sur l'optimisation et les systèmes d'information, pp.11-13, 2006.

S. A. Brah and J. L. Hunsucker, Branch and bound algorithm for the flow shop with multiple processors, European Journal of Operational Research, vol.51, issue.1, pp.88-99, 1991.
DOI : 10.1016/0377-2217(91)90148-O

G. H. Brooks and C. R. White, An algorithm for finding optimal or near optimal solution to the production scheduling problem, Journal of Industrial Ingineering, vol.16, issue.1, 1965.

P. Brucker, Ein effizienter Algorithmus zur L??sung des Job-Shop-Scheduling-Problems mit zwei Jobs, Computing, vol.8, issue.4, pp.353-359, 1988.
DOI : 10.1007/BF02276919

P. Brucker, B. Jurisch, and B. Sievers, A Beanch and Bound Algorithm for the Job-shop Scheduling Problem, Discrete Applied Mathematic, vol.49, pp.109-127, 1994.

R. E. Buten and V. Y. Shen, A scheduling model for compute systems with two classes of processors, Proceedings of the Sagamore Computer Conference on Parallel Processing, pp.130-138, 1973.

H. G. Campbell and R. A. Dudek, Machine Sequencing Problem, Management Science, vol.16, issue.10, pp.630-637, 1970.
DOI : 10.1287/mnsc.16.10.B630

V. Caraffa, S. Ianes, T. P. Bagchi, and C. Sriskandarajah, Minimizing makespan in a blocking flowshop using genetic algorithms, International Journal of Production Economics, vol.70, issue.2, pp.101-115, 2001.
DOI : 10.1016/S0925-5273(99)00104-8

J. Carlier and E. Pinson, A practical use of jackson's preemptive schedule for solving the job-shop problem, Annals of Operations Research, vol.26, pp.269-287, 1990.

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 and P. Chrétienne, Les problèmes d'ordonnancement: modélisation, complexité, algorithmes, 1988.

J. &. Carlier and I. Rebaï, Two branch and bound algorithms for the permutation flow shop problem, European Journal of Operational Research, vol.90, issue.2, pp.238-251, 1996.
DOI : 10.1016/0377-2217(95)00352-5

F. Chan, T. Wong, and L. Chan, Flexible job-shop scheduling problem under resource constraints, International Journal of Production Research, vol.44, issue.11, pp.2071-2089, 2006.
DOI : 10.1007/s00366-003-0260-4

H. Chen, J. Ihlow, and C. Lehmann, A genetic algorithm for flexible job-shop scheduling, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C), pp.1120-1125, 1999.
DOI : 10.1109/ROBOT.1999.772512

Y. Cho, . Sahni, and . Sartaj, Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops, Operations Research, vol.29, issue.3, pp.511-522, 1981.
DOI : 10.1287/opre.29.3.511

D. G. Dannenbring, An Evaluation of Flow Shop Sequencing Heuristics, Management Science, vol.23, issue.11, pp.1174-1182, 1977.
DOI : 10.1287/mnsc.23.11.1174

G. Dantzig, R. Fulkerson, and S. Johnson, Solution of a Large-Scale Traveling-Salesman Problem, Journal of the Operations Research Society of America, vol.2, issue.4, pp.393-410, 1954.
DOI : 10.1287/opre.2.4.393

S. Dauzère-pérès and C. Pavageau, Multi-resource shop scheduling with resource flexibility, European Journal of Operational Research, vol.107, issue.2, pp.289-305, 1998.
DOI : 10.1016/S0377-2217(97)00341-X

S. Dauzère-pérès, C. Pavageau, and N. Sauer, Modélisation et résolution par PLNE d'un problème réel d'ordonnancement avec contraintes de blocage, pp.216-217, 2000.

L. Davis, Job shop scheduling with genetic algorithms, International conference on Genetic Algorithms and their Applications, 1985.

M. Dell-'amico and M. Trubian, Applying tabu search to the job-shop scheduling problem, Annals of Operations Research, vol.1, issue.3, pp.231-252, 1993.
DOI : 10.1287/ijoc.2.1.4

U. Dorndorf and E. Pesch, Evolution based learning in a job shop scheduling environment, Computers & Operations Research, vol.22, issue.1, pp.92-111, 1992.
DOI : 10.1016/0305-0548(93)E0016-M

S. K. Dutta and A. A. Cunningham, Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage, Management Science, vol.21, issue.9, pp.989-996, 1975.
DOI : 10.1287/mnsc.21.9.989

J. Ezpeleta, J. M. Colom, and J. Martinez, A Petri net based deadlock prevention policy for flexible manufacturing systems, IEEE Transactions on Robotics and Automation, vol.11, issue.2, pp.173-184, 1995.
DOI : 10.1109/70.370500

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

M. P. Fanti and B. Maione, Event-based feedback control for deadlock avoidance in flexible production systems, IEEE Transactions on Robotics and Automation, vol.13, issue.3, pp.347-363, 1997.
DOI : 10.1109/70.585898

M. P. Fanti, B. Maione, and B. Turchiano, Deadlock Avoidance in flexible Production Systems with Multiple Capacity Resource, informatics and control, vol.7, issue.4, pp.343-364, 1998.

M. P. Fanti, B. Maione, and B. Turchiano, Digraph-theoritic Approach for Deadlock Detection and recovery in Flexible Procudtion Systems, informatics and control, vol.5, issue.4, pp.373-383, 1996.

H. Fisher and G. Thompson, Probabilistic learning combinations of local job-shop scheduling rules. Industrial Scheduling, pp.225-251, 1963.

M. Florian, G. Mcmahon, and P. Trepant, An Implicit Enumeration Algorithm for the Machine Sequencing Problem, Management Science, vol.17, issue.12, p.12, 1971.
DOI : 10.1287/mnsc.17.12.B782

M. R. Garey, D. S. Johnson, and R. Sethi, The Complexity of Flowshop and Jobshop Scheduling, Mathematics of Operations Research, vol.1, issue.2, pp.117-129, 1976.
DOI : 10.1287/moor.1.2.117

M. R. Garey and M. R. Johnson, Computers and intractability: A guide to the theory of NP-completeness, 1979.

R. Giffler and G. L. Thompson, Algorithms for Solving Production-Scheduling Problems, Operations Research, vol.8, issue.4, 1960.
DOI : 10.1287/opre.8.4.487

P. C. Gilmore and R. E. Gomory, Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem, Operations Research, vol.12, issue.5, pp.655-679, 1964.
DOI : 10.1287/opre.12.5.655

F. Glover, Tabu Search???Part I, ORSA Journal on Computing, vol.1, issue.3, pp.190-206, 1989.
DOI : 10.1287/ijoc.1.3.190

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

M. Gomes, A. Barbosa-póvoa, and A. Novais, Optimal scheduling for flexible job shop operation, International Journal of Production Research, vol.33, issue.11, pp.2323-2353, 2005.
DOI : 10.1016/S0360-8352(00)00048-6

R. E. Gomory, Outline of an algorithm for integer solutions to linear programs, Bulletin of the American Mathematical Society, vol.64, issue.5, pp.275-278, 1958.
DOI : 10.1090/S0002-9904-1958-10224-4

M. Gondran and M. Minoux, Graphs and algorithms, 1984.
URL : https://hal.archives-ouvertes.fr/hal-01304880

T. Gonzalez and S. Sahni, Flowshop and Jobshop Schedules: Complexity and Approximation, Operations Research, vol.26, issue.1, pp.36-52, 1978.
DOI : 10.1287/opre.26.1.36

. Gonzalez, &. Teofilo, . Sahni, and . Sartaj, Open Shop Scheduling to Minimize Finish Time, Journal of the ACM, vol.23, issue.4, pp.665-679, 1976.
DOI : 10.1145/321978.321985

URL : http://www.cs.ucsb.edu/~teo/papers/OSJACM.pdf

J. Grabowski and J. Pempera, Sequencing of jobs in some production system, European Journal of Operational Research, vol.125, issue.3, pp.535-550, 2000.
DOI : 10.1016/S0377-2217(99)00224-6

J. Grabowski, E. Skubalska, and C. Smutnicki, On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness, Journal of the Operational Research Society, vol.34, issue.7, pp.615-620, 1983.
DOI : 10.1057/jors.1983.142

R. L. Graham, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals Discrete Math, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

J. N. Gupta and E. A. Tunc, Schedules for a two-stage hybrid flowshop with parallel machines at the second stage, International Journal of Production Research, vol.7, issue.7, pp.1489-1502, 1991.
DOI : 10.1287/opre.36.3.445

J. N. Gupta, Two-Stage, Hybrid Flowshop Scheduling Problem, Journal of the Operational Research Society, vol.39, issue.4, pp.359-364, 1988.
DOI : 10.1057/jors.1988.63

N. G. Hall and C. Sriskandarajah, A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process, Operations Research, vol.44, issue.3, pp.510-525, 1996.
DOI : 10.1287/opre.44.3.510

M. Haouari and T. Ladhari, A branch-and-bound-based local search method for the flow shop problem, Journal of the Operational Research Society, vol.10, issue.10, pp.1076-1084, 2003.
DOI : 10.1007/3-540-44808-X_3

W. H. Hardgrave and G. L. Nemhauser, A Geometric Model and a Graphical Algorithm for a Sequencing Problem, Operations Research, vol.11, issue.6, pp.889-900, 1963.
DOI : 10.1287/opre.11.6.889

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

J. A. Hoogeveen, J. K. Lenstra, and B. Veltman, Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, European Journal of Operational Research, vol.89, issue.1, pp.172-175, 1996.
DOI : 10.1016/S0377-2217(96)90070-3

F. S. Hsieh and S. C. Cheng, Dispatching-driven deadlock avoidance controller synthesis for flexible manufacturing systems, IEEE Transactions on Robotics and Automation, vol.10, issue.2, pp.196-209, 1994.
DOI : 10.1109/70.282544

J. L. Hunsucker and S. A. Brah, Optimal scheduling in a flow shop with mutliple processors. Paper presented at the TIMS, ORSA Joint National Meeting in, pp.4-6, 1987.

E. Ignall and L. Schrage, Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems, Operations Research, vol.13, issue.3, pp.400-412, 1965.
DOI : 10.1287/opre.13.3.400

J. R. Jackson, An extension of Johnson's results on job IDT scheduling, Naval Research Logistics Quarterly, vol.1, issue.3, pp.201-203, 1956.
DOI : 10.1002/nav.3800030307

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

S. M. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, vol.1, issue.1, pp.61-68, 1954.
DOI : 10.1002/nav.3800010110

B. Jurisch, Lower bounds for the job-shop scheduling problem on multi-purpose machines, Discrete Applied Mathematics, vol.58, issue.2, pp.145-156, 1995.
DOI : 10.1016/0166-218X(93)E0124-H

B. Jurisch, Scheduling Jobs in Shops with multi-purpose machines, 1992.

B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

I. Khosla, The scheduling problem where multiple machines compete for a common local buffer, European Journal of Operational Research, vol.84, issue.2, pp.330-342, 1995.
DOI : 10.1016/0377-2217(93)E0352-X

I. S. Khosla, Scheduling of job shops with finite-capcity local buffers. Working paper, The Curtis L, 1989.

S. Kirkpatrick, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

URL : http://www.cs.virginia.edu/cs432/documents/sa-1983.pdf

M. A. Langston, Interstage Transportation Planning in the Deterministic Flow-Shop Environment, Operations Research, vol.35, issue.4, pp.556-564, 1987.
DOI : 10.1287/opre.35.4.556

E. L. Lawler, Optimal Sequencing of a Single Machine Subject to Precedence Constraints, Management Science, vol.19, issue.5, pp.544-546, 1973.
DOI : 10.1287/mnsc.19.5.544

C. Y. Lee and R. G. Vairaktarakis, Minimizing makespan in hybrid Flowshops. Operation Research Letters, pp.149-158, 1994.

R. Leisten, Flowshop sequencing problems with limited buffer storage. International journal of production research, pp.2085-2100, 1990.

J. K. Lenstra, R. Kan, A. H. Brucker, and P. , Complexity of Machine Scheduling Problems, Annals of Operations Research, pp.343-362, 1977.
DOI : 10.1016/S0167-5060(08)70743-X

E. M. Levner, Optimal planning of parts machining on a number of machines, Automat Remote Control, vol.12, pp.1972-1978, 1969.

T. Loukil, J. Teghem, and P. Fortemps, A multi-objective production scheduling case study solved by simulated annealing, European Journal of Operational Research, vol.179, issue.3, pp.709-722, 2007.
DOI : 10.1016/j.ejor.2005.03.073

H. R. Lourenço, Local optimization and the job shop scheduling problem, 1994.

M. Carthy, B. L. Liu, and J. , Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling, International journal of production research, issue.31, pp.59-79, 1993.

T. A. Marsland and Y. Björnsson, Variable Depth Search, Advances in Computer Games 9, pp.5-20, 2000.

S. Martinez, Ordonnancement de systèmes de production avec contraintes de blocage, 2005.

S. Martinez, Complexity of flowshop scheduling problems with a new blocking constraint, European Journal of Operational Research, vol.169, issue.3, pp.855-864, 2006.
DOI : 10.1016/j.ejor.2004.08.046

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

S. Martinez, C. Guèret, and N. Sauer, Heuristic algorithms for the two-stage flow-shop with a new blocking constraint, p.4, 2004.

Y. Mati, X. Xie, and N. Rezg, Les problèmes d'ordonnancent dans les systèmes de production Automatisés: modèle, complexité, 2002.

H. Matsuo, C. J. Suh, and R. S. Sullivan, A Controlled Search Simulated Annealing Method for the General Job-Shop Scheduling Problem, Graduate School of Business, 1988.

S. T. Mccormick, Sequencing in an Assembly Line with Blocking to Minimize Cycle Time, Operations Research, vol.37, issue.6, pp.925-936, 1989.
DOI : 10.1287/opre.37.6.925

M. Haouari and &. Hallah, Heuristic algorithms for the two-stage hybrid flow-shop problem. operations research letters, pp.43-53, 1997.

T. Nait, An ant colony system minimizing total tardiness for hybrid job shop scheduling problem with sequence dependent setup times and release dates, International Conference on Industrial Engineering and Systems Management, 2005.

T. Nait, Hybrid job-shop scheduling in a printing workshop, Ecole des Mines de Nantes-France, pp.775-762, 2004.

R. Nakano and T. Yamada, Conventional genetic algorithm for job-shop problems, Proceedings of the 4th International Conference on Genetic Algorithm and their Applications, pp.474-479, 1991.

S. L. Narasimhan and P. M. Mangiameli, A COMPARISON OF SEQUENCING RULES FOR A TWO-STATE HYBRID FLOW SHOP, Decision Sciences, vol.27, issue.2, pp.250-265, 1987.
DOI : 10.1287/opre.27.2.290

S. L. Narasimhan and S. S. Panwalker, Scheduling in a two-stage manufacturing process, International Journal of Production Research, vol.3, issue.4, pp.555-264, 1984.
DOI : 10.1080/05695557108974786

M. Nawaz, E. Enscore, and I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, vol.11, issue.1, pp.91-95, 1983.
DOI : 10.1016/0305-0483(83)90088-9

E. G. Negenman, Local search algorithms for the multiprocessor flow shop scheduling problem, European Journal of Operational Research, vol.128, issue.1, pp.147-158, 2001.
DOI : 10.1016/S0377-2217(99)00354-9

E. Néron, P. Baptiste, and J. N. Gupta, Solving hybrid flow shop problem using energetic reasoning and global operations, Omega, vol.29, issue.6, pp.501-511, 2001.
DOI : 10.1016/S0305-0483(01)00040-8

E. Nowicki, The permutation flow shop with buffers: A tabu search approach, European Journal of Operational Research, vol.116, issue.1, pp.205-219, 1999.
DOI : 10.1016/S0377-2217(98)00017-4

E. Nowicki and C. Smutnicki, A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, vol.91, issue.1, pp.160-175, 1996.
DOI : 10.1016/0377-2217(95)00037-2

E. Nowicki and C. Smutnicki, The flow shop with parallel machines: A tabu search approach, European Journal of Operational Research, vol.106, issue.2-3, pp.226-253, 1998.
DOI : 10.1016/S0377-2217(97)00260-9

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

C. Papadimitriou and P. Kanellakis, Flowshop scheduling with limited temporary storage, Journal of the ACM, vol.27, issue.3, pp.533-549, 1980.
DOI : 10.1145/322203.322213

B. Penz, Une méthode heuristique pour la résolution des problèmes de job-shop flexible, Journal européen des systèmes automatisés, vol.30, issue.6, pp.767-780, 1996.

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

C. N. Potts and L. N. Van-wassenhove, A decomposition algorithm for the single machine total tardiness problem, Operations Research Letters, vol.1, issue.5, pp.177-181, 1982.
DOI : 10.1016/0167-6377(82)90035-9

T. B. Rao, Sequencing in the order a? b with multiplicity of machines for a single operation, Opsearch, vol.7, pp.135-144, 1970.

I. Rechenberg, Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, 1973.

S. S. Reddi, Note???Sequencing with Finite Intermediate Storage, Management Science, vol.23, issue.2, pp.216-217, 1976.
DOI : 10.1287/mnsc.23.2.216

URL : http://pubsonline.informs.org/doi/pdf/10.1287/mnsc.23.2.216

C. R. Reeves, Improving the Efficiency of Tabu Search for Machine Sequencing Problems, Journal of the Operational Research Society, vol.44, issue.4, pp.375-382, 1993.
DOI : 10.1057/jors.1993.67

G. V. Reklaitis, Review of Scheduling of Process Operations, AIChE Symp. Ser, vol.78, issue.214, pp.119-133, 1982.

F. Riane, A. Artiba, and S. E. Elmaghraby, A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan, European Journal of Operational Research, vol.109, issue.2, pp.321-329, 1998.
DOI : 10.1016/S0377-2217(98)00060-5

H. Rock and G. Schmidt, Machine aggregation heuristics in shop scheduling, Methods of Operational Research, vol.45, pp.303-314, 1983.

C. Sauvey and N. Sauer, A genetic algorithm with genes-association recognition for flowshop scheduling problems, Journal of Intelligent Manufacturing, vol.33, issue.2, 2011.
DOI : 10.1145/321127.321128

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

T. J. Sawik, Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers, Mathematical and Computer Modelling, vol.31, issue.13, pp.31-39, 2000.
DOI : 10.1016/S0895-7177(00)00110-2

T. J. Sawik, A schedule algorithm for flexible flow lines with limited intermediate buffers Applied Stochastic Models and Data Analysis, pp.127-138, 1993.

T. J. Sawik, Scheduling flexible flow lines with no in-process buffers, International Journal of Production Research, vol.9, issue.5, pp.1357-1367, 1995.
DOI : 10.1287/opre.36.3.445

L. Schrage and K. R. Baker, Dynamic Programming Solution of Sequencing Problems with Precedence Constraints, Operations Research, vol.26, issue.3, pp.444-449, 1978.
DOI : 10.1287/opre.26.3.444

H. Schwefel, Numerische Optimierung Von Computer-Modellen Mittels Der Evolutions-Strategie, 1977.

C. Scrich, V. Armentano, and M. Laguna, Tardiness minimization in a flexible job shop: A tabu search approach, Journal of Intelligent Manufacturing, vol.15, issue.1, pp.130-115, 2004.
DOI : 10.1023/B:JIMS.0000010078.30713.e9

V. Y. Shen and Y. E. Chen, A scheduling strategy for the flow shop problem in a system with two classes of processors, Proceedings of the Conference on Information and Systems Science, pp.645-649, 1972.

H. D. Sherali, S. C. Sarin, and M. S. Kodialam, Models and algorithms for a two-stage production process, Production Planning & Control, vol.5, issue.3, pp.27-39, 1990.
DOI : 10.1137/0212018

Y. N. Sostkov, Optimal serving tow jobs with a regular criterion, Automation of Designing Processes. Minsk, pp.86-95, 1985.

I. Suhami and R. S. Mah, An implicit enumeration scheme for the flowshop problem with no intermediate storage, Computers & Chemical Engineering, vol.5, issue.2, pp.83-91, 1981.
DOI : 10.1016/0098-1354(81)87003-2

W. Szwarc, Solution of the Akers-Friedman Scheduling Problem, Operations Research, vol.8, issue.6, pp.782-788, 1960.
DOI : 10.1287/opre.8.6.782

P. J. Van-laarhoven, E. H. Aarts, and J. K. Lenstra, Job Shop Scheduling by Simulated Annealing, Operations Research, vol.40, issue.1, 1992.
DOI : 10.1287/opre.40.1.113

R. Vancheeswaran and M. A. Townsend, Two-stage heuristic procedure for scheduling job shops, Journal of Manufacturing Systems, vol.12, issue.4, 1993.
DOI : 10.1016/0278-6125(93)90322-K

B. Wardono and Y. Fathi, A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities, European Journal of Operational Research, vol.155, issue.2, pp.380-401, 2004.
DOI : 10.1016/S0377-2217(02)00873-1

F. Werner and A. 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

R. J. Wittrock, An Adaptable Scheduling Algorithm for Flexible Flow Lines, Operations Research, vol.36, issue.3, pp.445-453, 1988.
DOI : 10.1287/opre.36.3.445

R. J. Wittrock, Scheduling algorithms for flexible flow lines, IBM Journal of Research and Development, vol.29, issue.4, pp.401-412, 1985.
DOI : 10.1147/rd.294.0401

R. A. Wysk, N. S. Yang, and S. Joshi, Detection of deadlocks in flexible manufacturing cells, IEEE Transactions on Robotics and Automation, vol.7, issue.6, pp.853-859, 1991.
DOI : 10.1109/70.105378

W. Xia and Z. Wu, An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems, Computers & Industrial Engineering, vol.48, issue.2, pp.409-425, 2005.
DOI : 10.1016/j.cie.2005.01.018

K. Y. Xing, B. S. Hu, and H. X. Chen, Deadlock Avoidance Policy for Petri Net Modeling of flexible manufacturing Systems with Shared Resources, IEEE Transactions on Robotics and automation, vol.41, issue.2, pp.289-295, 1996.

K. Yuan, C. Sauvey, and N. Sauer, Application of EM algorithm to hybrid flow shop scheduling problems with a special blocking, 2009 IEEE Conference on Emerging Technologies & Factory Automation, 2009.
DOI : 10.1109/ETFA.2009.5347066

URL : https://hal.archives-ouvertes.fr/inria-00600396