/. Ta and . Php, Accessed: April 15, 2015. 2. ´ Eric Taillard homepage, 2015.

J. and C. Beck, Solution-guided multi-point constructive search for job shop scheduling, Journal of Artificial Intelligence Research, vol.29, issue.1, pp.49-77, 2007.

C. Bessiere, Constraint Propagation, Handbook of Constraint Programming, pp.29-83, 2006.
DOI : 10.1016/S1574-6526(06)80007-6

URL : https://hal.archives-ouvertes.fr/lirmm-00117128

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting Systematic Search by Weighting Constraints, Proceedings of the 16th European Conference on Artificial Intelligence, ECAI'04, pp.146-150, 2004.

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

L. Perron and E. Danna, Structured vs Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs, Proceedings of Principles and Practice of Constraint Programming -CP'03. LNCS No. 2833, pp.817-821, 2003.

T. Feydy, A. Schutt, and P. J. Stuckey, Semantic Learning for Lazy Clause Generation, Proceedings of TRICS Workshop: Techniques foR Implementing Constraint programming Systems, 2013.

T. Feydy and P. J. Stuckey, Lazy Clause Generation Reengineered, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, CP'09, pp.352-366, 2009.
DOI : 10.1147/rd.471.0057

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.300.6909

D. Grimes and E. Hebrard, Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach, Proceedings of the 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR'10, pp.147-161, 2010.
DOI : 10.1007/978-3-642-13520-0_19

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

D. Grimes and E. Hebrard, Models and Strategies for Variants of the Job Shop Scheduling Problem, Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming, pp.356-372, 2011.
DOI : 10.1007/978-3-642-23786-7_28

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

D. Grimes and E. Hebrard, Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search, INFORMS Journal on Computing, vol.27, issue.2, pp.268-284, 2015.
DOI : 10.1287/ijoc.2014.0625

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

D. Grimes, E. Hebrard, and A. Malapert, Closing the Open Shop: Contradicting Conventional Wisdom, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, pp.400-408, 2009.
DOI : 10.1007/978-3-540-68155-7_21

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

R. Stephen and . Lawrence, Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, 1984.

M. Luby, A. Sinclair, and D. Zuckerman, Optimal speedup of Las Vegas algorithms, Information Processing Letters, vol.47, issue.4, pp.173-180, 1993.
DOI : 10.1016/0020-0190(93)90029-9

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001.
DOI : 10.1145/378239.379017

W. Nuijten, Time and resource constrained scheduling: a constraint satisfaction approach, 1994.

O. Ohrimenko, P. J. Stuckey, and M. Codish, Propagation via lazy clause generation, Constraints, vol.37, issue.1???3, pp.357-391, 2009.
DOI : 10.1007/s10601-008-9064-x

M. Panos, O. V. Pardalos, and . Shylo, An algorithm for the job shop scheduling problem based on global equilibrium search techniques, Computational Management Science, vol.3, issue.4, pp.331-348, 2006.

M. Norman and . Sadeh, Lookahead techniques for micro-opportunistic job-shop scheduling, 1991.

A. Schutt, T. Feydy, P. J. Stuckey, and M. G. Wallace, Solving RCPSP/max by lazy clause generation, Journal of Scheduling, vol.16, issue.3, pp.273-289, 2013.
DOI : 10.1007/s10951-012-0285-x

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems Benchmarks for basic scheduling problems, Proceedings of Principles and Practice of Constraint Programming -CP'98, pp.417-431278, 1993.

P. Vilím, Edge Finding Filtering Algorithm for Discrete Cumulative Resources in ${\mathcal O}(kn {\rm log} n)$, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, CP'09, pp.802-816, 2009.
DOI : 10.1287/ijoc.1070.0226

P. Vilím, P. Laborie, and P. Shaw, Failure-Directed Search for Constraint-Based Scheduling, Proceedings of the 12th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR'15, p.page to appear, 2015.
DOI : 10.1007/978-3-319-18008-3_30

T. Walsh, Search in a Small World, Proceedings of the 16th International Joint Conference on Artificial Intelligence, IJCAI'99, pp.1172-1177, 1999.

L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik, Efficient Conflict Driven Learning in a Boolean Satisfiability Solver, Proceedings of the 2001 IEEE/ACM International Conference on Computer-aided Design, IC- CAD'01, pp.279-285, 2001.