P. Auer, N. Cesa-bianchi, and P. Fischer, Finite-time analysis of the multiarmed bandit problem Mean relative error, Machine Learning, vol.4723, issue.2, pp.235-256, 2002.

J. C. Beck, Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling, Journal of Artificial Intelligence Research, vol.29, pp.49-77, 2007.

S. Gelly, The grand challenge of computer Go, Communications of the ACM, vol.55, issue.3, pp.106-113, 2012.
DOI : 10.1145/2093548.2093574
URL : https://hal.archives-ouvertes.fr/hal-00695370

L. Kocsis and C. Szepesvári, Bandit Based Monte-Carlo Planning, pp.282-293, 2006.
DOI : 10.1007/11871842_29

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

R. Mathon and A. Rosa, Tables of parameters for BIBD's with r ? 41 including existence , enumeration, and resolvability results, Annals of Discrete Mathematics, vol.26, pp.275-308, 1985.

P. Meseguer, Interleaved depth-first search, pp.1382-1387, 1997.

A. Rimmel, F. Teytaud, and O. Teytaud, Biasing Monte-Carlo Simulations through RAVE Values, pp.59-68, 2010.
DOI : 10.1007/978-3-642-17928-0_6
URL : https://hal.archives-ouvertes.fr/inria-00485555

T. P. Runarsson, M. Schoenauer, and M. Sebag, Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling, pp.160-174, 2012.
DOI : 10.1007/978-3-642-34413-8_12
URL : https://hal.archives-ouvertes.fr/hal-00736968

J. P. Watson and J. C. Beck, A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem, pp.263-277, 2008.
DOI : 10.1007/978-3-540-68155-7_21