]. A. Chmeiss-1998, P. Chmeiss, and . Jégou, EFFICIENT PATH-CONSISTENCY PROPAGATION, International Journal on Artificial Intelligence Tools, vol.07, issue.02, pp.121-142, 1998.
DOI : 10.1142/S0218213098000081

]. A. Colmerauer, H. Kanoui, and M. Van-caneghem, Prolog, bases théoriques et développements actuels, Technique et science informatiques, Hermès, pp.29-127, 1982.

]. R. Debruyne and C. Bessière, Some practicable filtering techniques for the constraint satisfaction problem, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'97), pp.412-417, 1997.

]. R. Debruyne, Consistances locales pour les problèmes de satisfaction de contraintes de grande taille, Thèse de doctorat, 1998.

]. R. Dechter and I. Meiri, Experimental evaluation of preprocessing techniques in constraint satisfaction problems, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI'89), pp.271-277, 1989.

]. R. Dechter, Constraint processing, 2003.

]. Y. Deville and P. Van-hentenryck, An efficient arc consistency algorithm for a class of CSP problems, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'91), pp.325-330, 1991.

]. M. Dincbas, P. Van-hentenryck, H. Simonis, A. Aggoun, T. Graf et al., The Constraint Logic Programming Language CHIP, Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'88), pp.693-702, 1988.

]. P. Esquirol, P. Lopez, H. Fargier, and T. Schiex, Constraint programming, Belgian Journal of Operations Research, Special Issue Constraint Programming (JORBEL), vol.35, issue.2, pp.5-36, 1995.

]. E. Freuder, Synthesizing constraint expressions, Communications of the ACM, vol.21, issue.11, pp.958-966, 1978.
DOI : 10.1145/359642.359654
URL : http://dspace.mit.edu/handle/1721.1/6247#files-area

]. E. Freuder, A Sufficient Condition for Backtrack-Free Search, Journal of the ACM, vol.29, issue.1, pp.24-32, 1982.
DOI : 10.1145/322290.322292

]. E. Freuder and C. D. Elfe, Neighborhood inverse consistency preprocessing, Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96), pp.202-208, 1996.

]. D. Frost, C. Bessière, R. Dechter, and J. C. , Ré- gin. Random uniform CSP generators, 1996.

]. B. Gacias, C. Artigues, and P. Lopez, Tree and local search for parallel machine scheduling problems with precedence constraints and setup times, Proceedings of the 11th International Workshop on Project Management and Scheduling (PMS'08), 2008.
URL : https://hal.archives-ouvertes.fr/hal-00278735

]. D. Grimes and R. J. Wallace, Learning from failures in constraint satisfaction search, AAAI Workshop on Learning for Search, 2006.

]. P. Hansen and N. Mladenovic, Variable neighborhood search : principles and applications (invited review), European Journal of Operational Research, vol.130, pp.130-467, 2001.
DOI : 10.1016/s0377-2217(00)00100-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.1769

]. R. Haralick and G. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

]. W. Harvey, Nonsystematic Backtracking Search, 1995.

]. W. Harvey and M. L. Ginsberg, Limited Discrepancy Search, Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95), pp.607-615, 1995.

]. P. Hentenryck-1992a, Y. Van-hentenryck, C. M. Deville, and . Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2-3, pp.291-321, 1992.
DOI : 10.1016/0004-3702(92)90020-X

]. P. Hentenryck-1992b, H. Van-hentenryck, M. Simonis, and . Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence, vol.58, issue.1-3, pp.113-159, 1992.
DOI : 10.1016/0004-3702(92)90006-J

]. A. Hmida, M. J. Huguet, P. Lopez, and M. Haouari, Climbing depth-bounded discrepancy search for solving hybrid flow shop problems, European J. of Industrial Engineering, vol.1, issue.2, pp.223-243, 2007.
DOI : 10.1504/EJIE.2007.014110
URL : https://hal.archives-ouvertes.fr/hal-00159581

]. A. Hmida, M. Haouari, M. J. Huguet, and P. Lopez, Discrepancy search for the flexible job shop problem, Computers and Operation Research, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00461981

]. J. Hooker, Logic-based methods for optimization : combining optimization and constraint satisfaction, 2000.
DOI : 10.1002/9781118033036

M. J. Huguet, P. Lopez, and A. B. Hmida, A Limited Discrepancy Search method for solving disjunctive scheduling problems with resource flexibility, Ninth International Workshop on Project Management and Scheduling (PMS'04), pp.299-302, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00138200

]. M. Huguet, C. Artigues, M. Dugas, and P. Lopez, Generalized Constraint Propagation for Solving Job Shop Problems with time lags, Proceedings of the 12th International Workshop on Project Management and Scheduling (PMS'10), pp.239-242, 2010.

]. J. Jaffar and M. Maher, Constraint logic programming: a survey, Journal of Logic Programming, pp.503-581, 1994.
DOI : 10.1016/0743-1066(94)90033-7

]. W. Karoui, M. J. Huguet, P. Lopez, and W. Naanaa, Amélioration par apprentissage de la recherche à divergences limitées, Premières Journées Francophones de la Programmation par Contraintes (JFPC'05), pp.109-118, 2005.

]. W. Karoui, M. J. Huguet, P. Lopez, and W. Naanaa, Amélioration par apprentissage d'une méthode de recherche arborescente, 7ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROA- DEF'2006), 2006.

]. W. Karoui, M. J. Huguet, P. Lopez, and W. Naanaa, Apport de MDS à la résolution de CSP : application aux, 2007.

]. W. Karoui, M. J. Huguet, P. Lopez, and W. Naanaa, YIELDS: A Yet Improved Limited Discrepancy Search for CSPs, Proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'07), pp.99-111, 2007.
DOI : 10.1007/978-3-540-72397-4_8
URL : https://hal.archives-ouvertes.fr/hal-00140032

]. W. Karoui, M. J. Huguet, and P. Lopez, Impact des modes de comptage sur les méthodes à base de divergences, Conférence scientifique en Recherche Opérationnelle et d'Aide à la Décision (ROADEF'2009), 2009.

]. W. Karoui, M. J. Huguet, P. Lopez, and M. Haouari, Climbing discrepancy search for flowshop and jobshop scheduling with time lags, Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO'10), volume 1140 of Electronic Notes in Discrete Mathematics, 2010.
DOI : 10.1016/j.endm.2010.05.104
URL : https://hal.archives-ouvertes.fr/hal-00957670

]. W. Karoui, M. J. Huguet, P. Lopez, and M. Haouari, Limited discrepancy search for scheduling problems with time lags, 12th International Workshop on Project Management and Scheduling (PMS'10), pp.273-276, 2010.

]. W. Karoui, M. J. Huguet, P. Lopez, and M. Haouari, Méthodes de recherche à divergence limitée pour les problèmes d'ordonnancement avec contraintes de délais, 8ème conférence internationale de Modélisation et SI- Mulation (MOSIM'10), 2010.

]. R. Korf, Improved limited Discrepancy Search, Proceedings of the 13th National Conference on Artificial Intelligence (AAAI'96) and the 8th Innovative Applications of Artificial Intelligence Conference (IAAI'96), pp.286-291, 1996.

]. F. Laburthe, P. Savéant, S. De-givry, and J. Jaurdan, Eclair, a library of constraints over finite domains, 1998.

]. J. Lauriere, A language and a program for stating and solving combinatorial problems, Artificial Intelligence, vol.10, issue.1, pp.29-127, 1978.
DOI : 10.1016/0004-3702(78)90029-2

]. C. Lecoutre, L. Sais, S. Tabary, and V. Vidal, Last Conflict based Reasoning, Proceedings of the 17th European Conference on Artificial Intelligence (ECAI'06), pp.133-137, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00110097

]. C. Lecoutre and F. Hemery, A study of residual supports in arc consistency, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'07), pp.125-130, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00261267

]. C. Lecoutre, L. Sais, and J. Vion, Using SAT Encodings to derive CSP Value Ordering Heuristics, Journal on Satisfiability Boolean Modeling and Computation, vol.1, pp.69-186, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00191095

]. C. Lecoutre, C. Likitvivatanavong, S. Shannon, R. Yap, and Y. Zhang, Maintaining Arc Consistency with Multiple Residues, Constraint Programming Letters (CPL), vol.2, pp.3-19, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00868069

]. N. Levasseur, P. Boizumault, and S. Loudni, A Value Ordering Heuristic for Weighted CSP, 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007), pp.259-262, 2007.
DOI : 10.1109/ICTAI.2007.45

C. Likitvivatanavong, Y. Zhang, J. Bowen, and E. C. Freuder, Arc-consistency in MAC : A new perspective, Proceedings First International Workshop on Constraint Propagation and Implementation, 2004.

]. A. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

]. A. Mackworth and E. C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence, vol.25, issue.1, pp.65-74, 1985.
DOI : 10.1016/0004-3702(85)90041-4

]. D. Mehta and M. R. Van-dongen, Reducing checks and revisions in coarse-grained MAC algorithms, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'05), pp.236-241, 2005.

]. P. Meseguer and T. Walsh, Interleaved and Discrepancy Based Search, Proceedings of the 13 European Conference on Artificial Intelligence (ECAI'98), pp.239-243, 1998.

M. Milano and A. Roli, On the relation between complete and incomplete search : an informal discussion, Proceedings of the 4th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'02), 2002.

]. L. Mitten, Jobs on Two Machines with Arbitrary Time Lags, Management Science, vol.5, issue.3, pp.293-298, 1958.
DOI : 10.1287/mnsc.5.3.293

]. R. Mohr and T. C. Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
DOI : 10.1016/0004-3702(86)90083-4
URL : https://hal.archives-ouvertes.fr/inria-00548487

]. R. Mohr, A correct path consistency algorithm and an optimal generalized arc consistency algorithm. Rapport technique, CRIN, pp.87-117, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00548481

]. R. Mohr and G. Masini, Good old discrete relaxation, Proceedings of the European Conference on Artificial Intelligence (ECAI'88), pp.651-656, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00548479

]. E. Néron, F. Tercinet, and F. Sourd, Search tree based approaches for parallel machine scheduling, Computers & Operations Research, vol.35, issue.4, pp.1127-1137, 2008.
DOI : 10.1016/j.cor.2006.07.008

]. E. Nowicki and C. Smutnicki, A Fast Taboo Search Algorithm for the Job Shop Problem, Management Science, vol.42, issue.6, pp.797-813, 1996.
DOI : 10.1287/mnsc.42.6.797

]. M. Perlin, Arc consistency for factorable relations, Artificial Intelligence, vol.53, issue.2-3, pp.329-342, 1992.
DOI : 10.1016/0004-3702(92)90077-B

]. P. Prosser, HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM, Computational Intelligence, vol.1, issue.4, pp.268-299, 1993.
DOI : 10.1016/0004-3702(77)90007-8

]. J. Puget and M. Leconte, Beyond the Glass Box : Constraints as Objets, Twelfth International Symposium on Logic Programming, 1995.

]. J. Régin, A filtering algorithm for constraints of difference in CSPs American Association for Artificial Intelligence, Proceedings of the twelfth National Conference on Artificial Intelligence (AAAI'94, pp.362-367, 1994.

]. D. Sabin and E. C. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proceedings of the 2nd International Workshop on Principles and Practices of Constraint Programming (PPCP'94), pp.10-20, 1994.
DOI : 10.1007/3-540-58601-6_86