J. Adams, E. Balas, and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Manag. Sci, vol.34, issue.3, pp.391-401, 1988.

C. Artigues, J. C. Billaut, and C. Esswein, Maximization of solution flexibility for robust shop scheduling, Eur. J. Oper. Res, vol.165, issue.2, pp.314-328, 2005.

M. Aloulou, M. Kovalyov, and M. C. Portmann, Maximization in single machine scheduling, Ann. Oper. Res, vol.129, pp.21-32, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00100694

J. Berlinska and M. Drozdowski, Scheduling divisible MapReduce computations, J. Parallel Distrib. Comput, vol.71, issue.3, pp.450-459, 2011.

J. Berlinska and M. Drozdowski, Scheduling multilayer divisible computations, RAIRO Oper. Res, vol.49, issue.2, pp.339-368, 2015.

J. Billaut and A. Moukrim, Flexibility and Robustness in Scheduling, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00445442

J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Handbook on Scheduling. From Theory to Applications, 2015.

P. Brucker, Scheduling Algorithms, 5th edn, 2015.

J. Carlier, The one machine problem, Eur. J. Oper. Res, vol.11, issue.1, pp.42-47, 1982.

J. Carlier and P. Chretienne, An algorithm for solving the job-shop problem, Manag. Sci, vol.35, issue.2, pp.164-176, 1989.

A. D'ariano, D. Pacciarelli, and M. Pranzo, A branch and bound algorithm for scheduling trains in a railway network, Eur. J. Oper. Res, vol.183, issue.2, pp.643-657, 2007.

C. Esswein, J. C. Billaut, and V. A. Strusevich, Two-machine shop scheduling: compromise between flexibility and makespan value, Eur. J. Oper. Res, vol.167, issue.3, pp.796-809, 2005.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness, 1979.

Y. Kergosien, C. Lenté, J. Billaut, and S. Perrin, Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex, Comput. Oper. Res, vol.40, issue.10, pp.2508-2518, 2013.

P. Kouvelis and G. Yu, Robust Discrete Optimization and Its Applications, 1997.

S. Lawrence, Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement), 1984.

P. Lopez and F. Roubellat, , 2008.

N. Mebarki, O. Cardin, and C. Guérin, Evaluation of a new human-machine decision support system for group scheduling, 12th IFAC, IFIP, IFORS, IEA Symposium on Analysis, Design, and Evaluation of Human-Machine Systems, vol.12, pp.211-217, 2013.

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

G. Pinot and N. Mebarki, An exact method for the best case in a group sequence: application to a general shop problem, 13th IFAC Symposium on Information Control Problems in Manufacturing, pp.1269-1274, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00410125

F. Roubellat, J. Billaut, and M. Villaumié, Ordonnancement d'atelier en temps réel: d'ORABAIDà ORDO. Revue d'automatique et de productique appliquées, vol.8, pp.683-713, 1995.

B. Roy and B. Sussman, Les problemes d'ordonnancement avec contraintes disjonctives, SEMA, issue.9, 1964.

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

Z. Yahouni, N. Mebarki, and Z. Sari, New lower bounds for the best-case schedule in groups of permutable operations, IFAC-PapersOnLine, vol.48, issue.3, pp.1134-1139, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02136907