A. Aggoun and N. Beldiceanu, Extending chip in order to solve complex scheduling and placement problems, Mathematical and Computer Modelling, vol.17, issue.7, pp.57-73, 1993.
DOI : 10.1016/0895-7177(93)90068-A
URL : https://hal.archives-ouvertes.fr/hal-00442821

C. Ansótegui, C. P. Gomes, and B. Selman, The Achilles' Heel of QBF, AAAI, pp.275-281, 2005.

P. Baptiste, C. L. Pape, and W. Nuijten, Constraint- Based Scheduling. Operations Research and Management Science, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00123562

J. F. Bard, Practical Bilevel Optimization : Algorithms and Applications, volume 30 of Nonconvex Optimization and Its Applications, 1999.
DOI : 10.1007/978-1-4757-2836-1

N. Beldiceanu and M. Carlsson, A New Multi-resource cumulatives Constraint with Negative Heights, Lecture Notes in Computer Science, vol.2470, pp.63-79, 2002.
DOI : 10.1007/3-540-46135-3_5

M. Benedetti, A. Lallouet, and J. Vautard, QCSP Made Practical by Virtue of Restricted Quantification, International Joint Conference on Artificial Intelligence, pp.38-43, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00144921

J. Bidot, T. Vidal, P. Laborie, and J. C. Beck, A General Framework for Scheduling in a Stochastic Environment, IJCAI, pp.56-61, 2007.

G. G. Brown, W. M. Carlyle, J. Royset, and R. K. Wood, On the Complexity of Delaying an Adversary???s Project, The Next Wave in Computing, Optimization and Decision, 2005.
DOI : 10.1007/0-387-23529-9_1

M. Ghallab, D. Nau, and P. Traverso, Automated Planning, 2004.

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

J. Leung, L. Kelly, and J. H. Anderson, Handbook of Scheduling : Algorithms, Models, and Performance Analysis, 2004.

S. F. Smith, N. Policella, A. Oddi, and A. Cesta, Generating Robust Partial Order Schedules, Principles and Practice of Constraint Programming16] P. Nightingale. Consistency and the Quantified Constraint Satisfaction Problem, pp.496-511, 2004.

C. H. Papadimitriou, Computational Complexity, 1994.

N. Policella, Scheduling with Uncertainty : A Proactive Approach Using Partial Order Schedules, 2005.

C. Schulte and G. Tack, Views and Iterators for Generic Constraint Implementations, Lecture Notes in Computer Science, vol.3709, pp.817-821, 2005.
DOI : 10.1007/11564751_71

J. Larry and . Stockmeyer, The polynomial-time hierarchy, Theor. Comput. Sci, vol.3, issue.1, pp.1-22, 1976.

C. W. Wu, K. N. Brown, and J. C. Beck, Scheduling with Uncertain Durations : Generating Beta-Robust Schedules using Constraint Programming, ICAPS 2006 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, 2006.
DOI : 10.1016/j.cor.2008.08.008