. De-contribuer-À-la-réponse-À-ce-point, En pratique, différents objectifs sont à optimiser dans un problème d'ordonnancement d'atelier. Dans ce cas, une des pistes possibles serait de calculer le compromis entre le meilleur des cas de chaque objectif Une deuxième perspective intéressante serait de développer des heuristiques/métaheuristiques calculant le meilleur des cas, surtout pour les objectifs non-réguliers où lorsque les bornes inférieures ne peuvent pas être calculées en temps polynomial

. Dans-ce-contexte, il faut développer en premier lieu des interfaces ergonomiques permettant de mieux représenter les perturbations et leurs conséquences De plus, le système de contrôle des décisions utilisé dans l'expérimentation exposée dans la dernière partie de cette thèse pourrait être amélioré. Il serait intéressant de proposer un système de contrôle permettant de déléguer les décisions entre l'humain et la machine en prenant en compte l

, Bibliographie

M. Aloulou, M. Kovalyov, and M. C. Et-portmann, Maximization Problems in Single Machine Scheduling, Annals of Operations Research, vol.129, issue.1-4, pp.21-32, 2004.
DOI : 10.1023/B:ANOR.0000030679.25466.02
URL : https://hal.archives-ouvertes.fr/inria-00100694

M. A. Aloulou and C. Et-artigues, Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case, Computers & Operations Research, vol.37, issue.5, pp.890-898, 2010.
DOI : 10.1016/j.cor.2009.03.021
URL : https://hal.archives-ouvertes.fr/hal-00158669

J. C. Ammons, T. Govindaraj, and C. M. Et-mitchell, Human aided scheduling for fms : a supervisory control paradigm for real-time control of flexible manufacturing systems, Annals of Operations Research, vol.15, pp.1-4, 1986.

C. Artigues, Ordonnancement en temps réel d'ateliers avec temps de préparation des ressources LAAS -Laboratoire d'analyse et d'architecture des systèmes, p.46, 1997.

C. Artigues, Optimisation et robustesse en ordonnancement sous contraintes de ressources URL http://www.laas.fr/~artigues/ hdrChristianArtigues.pdf. Habilitation à diriger des recherches, p.35, 2004.

C. Artigues, J. C. Billaut, and C. Et-esswein, Maximization of solution flexibility for robust shop scheduling, European Journal of Operational Research, vol.165, issue.2, pp.314-328, 2005.
DOI : 10.1016/j.ejor.2004.04.004

C. Artigues, . Billaut, . Jean-charles, . Cherif, . Bachir et al., Robust Machine Scheduling Based on Group of Permutable Jobs, Analysis in Decision Aiding, Optimization, and Analytics, International Series in Operations Research and Management Science, p.54, 2016.
DOI : 10.1016/j.ifacol.2015.06.236

P. Baptiste, M. Flamini, F. Et, and . Sourd, Lagrangian bounds for just-in-time job-shop scheduling, Computers & Operations Research, vol.35, issue.3, pp.906-915, 2008.
DOI : 10.1016/j.cor.2006.05.009
URL : https://hal.archives-ouvertes.fr/hal-01185207

J. Beasley, Job shop benchmark instances, 2004.

J. C. Beck, N. Et-wilson, M. Berglunda, and J. Et-karltuna, Proactive algorithms for job shop scheduling with probabilistic durations. journal of artificial intelligence research Human, technological and organizational aspects influencing the production scheduling process, International Journal of Production Economics, vol.28, issue.80, pp.183-232, 2007.
DOI : 10.1613/jair.2080
URL : https://cora.ucc.ie/bitstream/10468/1119/1/BeckWilsonJAIR07.pdf

J. Bidot, . Vidal, . Thierry, P. Laborie, J. Beck et al., A theoretic and practical framework for scheduling in a stochastic environment, Journal of Scheduling, vol.47, issue.4, pp.315-344, 2008.
DOI : 10.1017/S0269888900001089

J. Billaut, Prise en compte des ressources multiples et des temps de préparation dans les problèmes d'ordonnancement en temps réel, Thèse de doctorat, p.46, 1993.

J. C. Billaut, A. Moukrim, E. Et-sanlaville, . Flexibility, . Robustness-in et al., , pp.35-101, 2008.

J. Blazewicz, Scheduling in Computer and Manufacturing Systems, 1996.
DOI : 10.1007/978-3-662-00074-8

P. Brucker, E. K. Burke, and S. Et-groenemeyer, A branch and bound algorithm for the cyclic job-shop problem with transportation, Computers & Operations Research, vol.39, issue.12, pp.3200-3214, 2012.
DOI : 10.1016/j.cor.2012.04.008

P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Et-pesch, Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research, vol.112, issue.1, pp.3-41, 1999.
DOI : 10.1016/S0377-2217(98)00204-5

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

P. Brucker and S. Et-knust, Complexity results for scheduling problems, p.55, 2007.

P. Brucker, S. A. Kravchenko, and Y. N. Et-sotskov, Preemptive job-shop scheduling problems with a fixed number of jobs, Mathematical Methods of Operations Research, vol.49, issue.1, pp.41-76, 1999.

P. Brucker and B. Jurisch, A new lower bound for the job-shop scheduling problem, European Journal of Operational Research, vol.64, issue.2, pp.156-167, 1993.
DOI : 10.1016/0377-2217(93)90174-L

. Brucker, . Peter, . Jurisch, . Bernd, and A. Kramer, The job-shop problem and immediate selection, Annals of Operations Research, vol.25, issue.1, pp.73-114, 1994.
DOI : 10.1287/ijoc.3.2.149

M. J. Brusco and S. Stahl, Branch-and-Bound Applications in Combinatorial Data Analysis, Statistics and Computing, vol.221, p.18, 2005.

T. Bui and J. Lee, An agent-based framework for building decision support systems, Decision Support Systems, vol.25, issue.3, pp.225-237, 1999.
DOI : 10.1016/S0167-9236(99)00008-1

O. Cardin, . Mebarki, . Nasser, and G. Pinot, A study of the robustness of the group scheduling method using an emulation of a complex FMS, International Journal of Production Economics, vol.146, issue.1, pp.199-207, 2013.
DOI : 10.1016/j.ijpe.2013.06.023
URL : https://hal.archives-ouvertes.fr/hal-01115937

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 and E. Et-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 E. Et-pinson, A practical use of jackson's preemptive schedule for solving the job shop problem, Annal of Operation Research, vol.26, issue.1-4, pp.269-287, 1991.

J. Carlier and E. Et-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

T. Chaari, Un algorithme génétique pour l'ordonnancement robuste : application au problème du flow shop hybride, p.22, 2010.

F. T. Chan, H. K. Chan, and H. C. Et-lau, The State of the Art in Simulation Study on FMS Scheduling: A Comprehensive Survey, The International Journal of Advanced Manufacturing Technology, vol.19, issue.11, pp.830-849, 2002.
DOI : 10.1007/s001700200095

S. Crawford, B. L. Maccarthy, J. R. Wilson, and C. Et-vernon, Investigating the Work of Industrial Schedulers through Field Study, Cognition, Technology & Work, vol.1, issue.2, pp.63-77, 1999.
DOI : 10.1007/s101110050033

S. Crawford, V. C. Et-wiers, B. L. Maccarthy, J. R. Et, and . Wilson, From anecdotes to theory : a review of existing knowledge on human factors of planning and scheduling. Dans Human performance in planning and scheduling, pp.15-43, 2001.

R. L. Daniels and J. Et-carrillo, Beta-robust scheduling for single-machine systems with uncertain processing times, IIE Transactions, vol.29, issue.28, pp.977-985, 1997.

A. J. Davenport and J. C. Et-beck, A survey of techniques for scheduling with uncertainty, p.26, 2000.

D. Debels and M. Vanhoucke, Future research avenues for resource-constrained project scheduling : search space restriction or neighbourhood search extension, Proceedings of the 10th International Workshop on Project Management and Scheduling, pp.110-113, 2006.

G. Dewess, An existence theorem for packing problems with implications for the computation of optimal machine schedules. Optimization, pp.261-269, 1992.

C. Dimopoulos, . Cegarra, . Julien, . Papageorgiou, . George et al., Interdisciplinary design of scheduling decision support systems in small-sized SME environments: The i-DESME framework, Journal of Decision Systems, vol.31, issue.3, pp.227-254, 2015.
DOI : 10.1016/S0305-0483(96)00050-3

M. Drummond, . Bresina, . John, and K. Swanson, Just-in-case scheduling American Association for Artificial Intelligence, Proceedings of the Twelfth National Conference on Artificial Intelligence AAAI'94, pp.1098-1104, 1994.

R. Erschler, AN APPROACH FOR REAL TIME SCHEDULING OF ACTIVITIES WITH TIME AND RESOURCE CONSTRAINTS, Advances in project scheduling, p.38, 1989.
DOI : 10.1016/B978-0-444-87358-3.50015-8

C. Esswein, Un apport de flexibilité séquentielle pour l'ordonnancement robuste, pp.45-46, 2003.

C. Esswein, J. Billaut, . Charles, and V. Et-strusevich, A. some heuristics for incorporating flexibility into job shop solutions, HEURO/INFORMS Joint International Meeting, p.46, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01025682

C. Fang, R. Kolisch, L. Wang, and C. Et-mu, An estimation of distribution algorithm and new computational results for the stochastic resource-constrained project scheduling problem, Flexible Services and Manufacturing Journal, vol.60, issue.4, pp.585-605
DOI : 10.1016/j.cie.2011.01.005

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

M. S. Fox, Constraint-guided scheduling -a short history of research at cmu. Computers in Industry, pp.79-88, 1990.
DOI : 10.1016/0166-3615(90)90107-z

N. Fu, . Varakantham, . Pradeep, H. Lau, and . Chuin, Towards finding robust execution strategies for rcpsp/max with durational uncertainty, Proceedings of the 20th International Conference on Automated Planning and Scheduling, ICAPS 2010, pp.73-80, 2010.

. Gacias, . Bernat, . Cegarra, . Julien, and P. Lopez, Scheduler-oriented algorithms to improve human???machine cooperation in transportation scheduling support systems, Engineering Applications of Artificial Intelligence, vol.25, issue.4, pp.801-813, 2012.
DOI : 10.1016/j.engappai.2011.11.010
URL : https://hal.archives-ouvertes.fr/hal-00661305

H. L. Gantt, Work, wages, and profits. New York : The Engineering magazine co, p.14, 1919.

M. R. Garey, . Et-johnson, and S. David, Computers and Intractability : A Guide to the Theory of NP-Completeness, p.17, 1979.

M. R. Garey, D. S. Johnson, and R. Et-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

R. Gasser, . Fischer, . Katrin, T. Et-wäfler, . Scheduling et al., Decision Making in Planning and Scheduling: A Field Study of Planning Behaviour in Manufacturing, Dans Behavioral Operations in Planning, pp.11-30, 2011.
DOI : 10.1007/978-3-642-13382-4_2

. Gigerenzer, . Gerd, P. M. Todd, and A. Et-group, Simple Heuristics that Make us Smart, p.79, 1999.

T. Gilovich, D. Griffin, and D. Et-kahneman, Heuristics and Biases : The Psychology of Intuitive Judgment, p.81, 2002.
DOI : 10.1017/CBO9780511808098

E. Goldratt, Critical chain. north river : Great barringto, p.27, 1997.

. Gotha, Les problèmes d'ordonnancement. RAIRO -Operations Research, pp.77-150, 1993.

. Gotha, Flexibilité et robustesse en ordonnancement, p.25, 2002.

R. L. Graham and E. L. Et-lawler, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Math, vol.5, issue.11, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X
URL : https://ir.cwi.nl/pub/18052/18052A.pdf

C. Guérin, Gestion de contraintes et expertise dans les stratégies d'ordonnancement, pp.95-111, 2013.

D. Hardman and L. Et-macchi, Thinking : Psychological Perspectives on Reasoning, Judgment and Decision Making, p.81, 2003.
DOI : 10.1002/047001332X

W. Herroelen and R. Et-leus, Project scheduling under uncertainty: Survey and research potentials, European Journal of Operational Research, vol.165, issue.2, pp.289-306, 2005.
DOI : 10.1016/j.ejor.2004.04.002
URL : https://lirias.kuleuven.be/bitstream/123456789/202160/2/or_0225.pdf

J. M. Hoc, C. Guerin, and N. Et-mebarki, The Nature of Expertise in Scheduling: The Case of Timetabling, Human Factors and Ergonomics in Manufacturing & Service Industries, vol.18, issue.2, pp.192-206, 2012.
DOI : 10.1207/s15516709cog1801_3
URL : https://hal.archives-ouvertes.fr/hal-01160217

J. M. Hoc, N. Mebarki, and J. Et-cegarra, L'assistance ?? l'op??rateur humain pour l'ordonnancement dans les ateliers manufacturiers, Le travail humain, vol.67, issue.2, pp.181-208, 2004.
DOI : 10.3917/th.672.0181

J. R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report, vol.43, p.51, 1955.

S. Jackson, J. R. Wilson, and B. L. Et-maccarthy, A New Model of Scheduling in Manufacturing: Tasks, Roles, and Monitoring, Human Factors: The Journal of the Human Factors and Ergonomics Society, vol.12, issue.4, pp.533-550, 2004.
DOI : 10.1080/09537289608930366

A. Jain, . Singh, . Meeran, and . Sheik, A state of the art review of job-shop scheduling techniques, p.18, 1998.

P. Kouvelis and G. Et-yu, Robust Discrete Optimization and Its Applications, p.23, 1997.
DOI : 10.1007/978-1-4757-2620-6

S. A. Kravchenko, Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem, Discrete Applied Mathematics, vol.98, issue.3, pp.209-217, 1999.
DOI : 10.1016/S0166-218X(99)00165-1

W. Kubiak and V. G. Et-timkovsky, Total completion time minimization in two-machine job shops with unit-time operations, European Journal of Operational Research, vol.94, issue.2, pp.310-320, 1996.
DOI : 10.1016/0377-2217(96)00132-4

H. La and . Trung, Utilisation d'ordres partiels pour la caractérisation de solutions robustes en ordonnancement, pp.22-35, 2005.

P. Lamas and E. Demeulemeester, A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations, Journal of Scheduling, vol.189, issue.3, pp.409-428, 2015.
DOI : 10.1016/j.ejor.2006.10.061

O. Lambrechts, E. Demeulemeester, and W. Et-herroelen, Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities, Journal of Scheduling, vol.97, issue.2, pp.121-136, 2008.
DOI : 10.1007/978-3-642-57570-9
URL : https://papers.ssrn.com/sol3/Delivery.cfm?abstractid=950917

G. Lancia, F. Rinaldi, P. Et, and . Serafini, A time-indexed LP-based approach for min-sum job-shop problems, Annals of Operations Research, vol.35, issue.1, pp.175-198, 2011.
DOI : 10.1016/j.cor.2006.02.024
URL : http://users.dimi.uniud.it/~paolo.serafini/jobshop.pdf

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

S. Lawrence, Resource constrained project scheduling : an experimental investigation of heuristic scheduling techniques (supplement), p.59, 1984.

L. Gall and A. , Un système intéractif d'aide à la décision pour l'ordonnancement et le pilotage en temps réel d'atelier, p.38, 1989.

L. Pape and C. , Constraint propagation in Planning and Scheduling, p.24, 1991.

J. K. Lenstra and A. H. Et-rinnooy-kan, Computational Complexity of Discrete Optimization Problems, Annals of Discrete Mathematics, vol.4, pp.121-140, 1979.
DOI : 10.1016/S0167-5060(08)70821-5

J. K. Lenstra, R. Kan, A. H. Et-brucker, and P. , Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, vol.1, pp.343-362, 1977.
DOI : 10.1016/S0167-5060(08)70743-X
URL : https://ir.cwi.nl/pub/18051/18051A.pdf

V. Leon, . Jorge, S. Wub, . David, . Storer et al., ROBUSTNESS MEASURES AND ROBUST SCHEDULING FOR JOB SHOPS, IIE Transactions, vol.41, issue.5, pp.32-43, 1994.
DOI : 10.1080/00207548508904739

B. J. Lobo, T. J. Hodgson, R. E. King, K. A. Thoney, and J. R. Et-wilson, An effective lower bound on <mml:math altimg="si0041.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>max</mml:mi></mml:mrow></mml:msub></mml:math> in a worker-constrained job shop, Computers & Operations Research, vol.40, issue.1, pp.328-343, 2013.
DOI : 10.1016/j.cor.2012.07.003

P. Lopez and F. Et-roubellat, Production scheduling, p.86, 2008.
DOI : 10.1002/9780470611050
URL : https://hal.archives-ouvertes.fr/hal-00689097

N. Mebarki, L'ordonnancement d'atelier sous incertitudes : l'intégration du facteur humain., 2012. Habilitation à diriger des recherches, p.82

N. Mebarki, O. Cardin, and C. Et-guérin, Evaluation of a new human-machine decision support system for group scheduling, IEA Symposium on Analysis, Design, and Evaluation of Human-Machine Systems, IFAC HMS 2013, pp.211-217, 2013.
DOI : 10.3182/20130811-5-US-2037.00040

M. A. Monfared and J. B. Et-yang, Design of integrated manufacturing planning, scheduling and control systems: a new framework for automation, The International Journal of Advanced Manufacturing Technology, vol.14, issue.3, pp.545-559, 2007.
DOI : 10.1007/978-1-4471-0753-8

K. Morikawa and K. Takahashi, A flexible branch and bound method for the job shop scheduling problem, Industrial Engineering & management systems, vol.8, issue.52, pp.239-246, 2009.

C. Muise, J. Beck, . Christopher, . Mcilraith, and A. Sheila, Flexible execution of partial order plans with temporal constraints, International Joint Conference On Artificial Intelligence, pp.2328-2335, 2013.

J. F. Muth, G. L. Et-thompson, and . Scheduling, , p.53, 1963.

S. Ourari, De l'ordonnancement déterministe à l'ordonnancement distribué sous incertitudes, p.23, 2011.

M. L. Pinedo, Scheduling : Theory, Algorithms, and Systems, 2012.

G. Pinot, Coopération homme-machine pour l'ordonnancement sous incertitudes, pp.58-60, 2008.

H. Plessner, C. Betsch, and T. Et-betsch, Intuition in Judgement and Decision Making, p.81, 2008.

N. Policella, . Oddi, . Angelo, . Smith, F. Stephen et al., Generating robust partial order schedules. Dans Principles and Practice of Constraint Programming ? CP, 10th International Conference Proceedings, Wallace, Mark (éditeur), pp.496-511, 2004.

F. Roubellat, J. C. Billaut, and M. Et-villaumié, Ordonnancement d'atelier en temps réel : d'orabaid à ordo. revue d'automatique et de productique appliquées, pp.683-713, 1995.

B. Roy and B. Et-sussmann, Les problèmes d'ordonnancement avec contraintes disjonctives, p.13, 1964.

I. Sabuncuoglu and S. Et-goren, Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research, International Journal of Computer Integrated Manufacturing, vol.2, issue.2, pp.138-157, 2009.
DOI : 10.1023/A:1013333232691

E. Sadeh, S. Otsuka, and R. Et-schelback, Predictive and reactive scheduling with the microboss production scheduling and control system. Workshop on knowledge-Based Production Planning, Scheduling and Control, pp.293-306, 1993.

P. M. Sanderson, The Human Planning and Scheduling Role in Advanced Manufacturing Systems: An Emerging Human Factors Domain, Human Factors: The Journal of the Human Factors and Ergonomics Society, vol.5, issue.1, pp.31-635, 1989.
DOI : 10.1037/h0037186

E. Sanlaville, Ordonnancement sous conditions changeantes : Comment prendre en compte les variations, aléas, incertitudes sur les données ?, p.23, 2005.

L. Schrage, Solving Resource-Constrained Network Problems by Implicit Enumeration???Nonpreemptive Case, Operations Research, vol.18, issue.2, pp.263-278, 1970.
DOI : 10.1287/opre.18.2.263

M. Sevaux and K. Et-sörensen, A genetic algorithm for robust schedules in a just-in-time environment, Quarterly Journal of the Belgian, vol.2, issue.2, pp.129-147, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00008731

R. Slowinski and J. Et-weglarz, Advances in project scheduling, p.86, 1989.

S. Smith, Reactive Scheduling Systems, pp.155-192, 1994.
DOI : 10.1007/978-1-4615-2263-8_7

Y. N. Sotskov, The complexity of shop-scheduling problems with two or three jobs, European Journal of Operational Research, vol.53, issue.3, pp.323-336, 1991.
DOI : 10.1016/0377-2217(91)90066-5

Y. N. Sotskov and N. Et-shakhlevich, NP-hardness of shop-scheduling problems with three jobs, Discrete Applied Mathematics, vol.59, issue.3, pp.237-266, 1995.
DOI : 10.1016/0166-218X(95)80004-N
URL : https://doi.org/10.1016/0166-218x(95)80004-n

E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, issue.2, pp.278-285, 1993.
DOI : 10.1016/0377-2217(93)90182-M

. Tanaka, . Shunji, . Sadykov, . Ruslan, and B. Et-detienne, A new lagrangian bound for the min-sum job-shop scheduling, Proceedings of the International Symposium on Scheduling ISS'2015, p.53, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01248322

V. Thomas, Aide à la décision pour l'ordonnancement d'atelier en temps réel, p.43, 1980.

V. G. Timkovsky, Is a unit-time job shop not easier than identical parallel machines?, Discrete Applied Mathematics, vol.85, issue.2, pp.149-162, 1998.
DOI : 10.1016/S0166-218X(98)00032-8
URL : https://doi.org/10.1016/s0166-218x(98)00032-8

T. Kindt, . Vincent, and J. Billaut, Multicriteria Scheduling : Theory, Models and Algorithms, p.30, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01067335

D. Trentesaux, P. Pesin, and C. Et-tahon, Distributed artificial intelligence for fms scheduling , control and design support, Journal of Intelligent Manufacturing, vol.11, issue.6, pp.573-589, 2000.
DOI : 10.1023/A:1026556507109

A. Tversky and D. Et-kahneman, Judgment under Uncertainty: Heuristics and Biases, Science, vol.185, issue.4157, pp.1124-1131, 1974.
DOI : 10.1126/science.185.4157.1124

S. Van-de-vonder, Proactive/reactive procedures for robust project schedulin, p.27, 2006.

. Van-de-vonder, . Stijn, E. Demeulemeester, and W. Et-herroelen, A classification of predictive-reactive project scheduling procedures, Journal of Scheduling, vol.56, issue.2, pp.195-207, 2007.
DOI : 10.1007/s10951-007-0011-2

S. Van-de-vonder, . Van, . Ballestínb, . Francisco, . Demeulemeestera et al., Heuristic procedures for reactive project scheduling, Computers & Industrial Engineering, vol.52, issue.1, pp.11-28, 2007.
DOI : 10.1016/j.cie.2006.10.002

. Wezel, . Wout, . Cegarra, . Julien, . Hoc et al., Allocating functions to human and algorithm in scheduling, Behavioral Operations in Planning and Scheduling, pp.339-370, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00521399

C. Wua, . Wei, K. N. Browna, J. Et-beckb, and . Christopher, Scheduling with uncertain durations: Modeling -robust scheduling with constraints, Computers & Operations Research, vol.36, issue.8, pp.2348-2356, 2009.
DOI : 10.1016/j.cor.2008.08.008

J. Yang, . Yu, and . Gang, On the robust single machine scheduling problem, Journal of Combinatorial Optimization, vol.6, issue.1, pp.17-33, 2002.
DOI : 10.1023/A:1013333232691