K. Apt, Principles of Constraint Programming, 2003.
DOI : 10.1017/CBO9780511615320

R. Asín and R. Nieuwenhuis, Cardinality Networks: a theoretical and empirical study, Constraints, vol.68, issue.2, pp.195-221, 2011.
DOI : 10.1007/s10601-010-9105-0

G. Audemard and L. Simon, Predicting Learnt Clauses Quality in Modern SAT Solvers, Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI'09, pp.399-404, 2009.

F. Bacchus, GAC Via Unit Propagation, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, pp.133-147, 2007.
DOI : 10.1007/978-3-540-74970-7_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.1322

F. Bacchus and P. Van-run, Dynamic variable ordering in CSPs, Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming, CP'95, pp.258-275, 1995.
DOI : 10.1007/3-540-60299-2_16

P. Baptiste, C. L. Pape, and W. Nuijten, Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. International series in Operations Research and Management Science, 2001.
DOI : 10.1007/978-1-4615-1479-4
URL : https://hal.archives-ouvertes.fr/inria-00123562

P. Baptiste, C. L. Pape, and L. Péridy, Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints, Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming , CP'98, pp.87-101, 1998.
DOI : 10.1007/3-540-49481-2_8

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.

J. , C. Beck, P. Prosser, and R. Wallace, Trying again to failfirst, Recent Advances in Constraints, pp.41-55, 2005.
DOI : 10.1007/11402763_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2098

C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the Desirability of Acyclic Database Schemes, Journal of the ACM, vol.30, issue.3, pp.479-513, 1983.
DOI : 10.1145/2402.322389

N. Beldiceanu and M. Carlsson, Revisiting the cardinality operator and introducing the cardinality-path constraint family, Proceedings of the 17th International Conference on Logic Programming, ICLP'01, pp.59-73, 2001.

N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Global Constraint Catalogue: Past, Present and Future, Constraints, vol.2, issue.1, pp.21-62, 2007.
DOI : 10.1007/s10601-006-9010-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.251

N. Beldiceanu and E. Contejean, Introducing global constraints in CHIP, Mathematical and Computer Modelling, vol.20, issue.12, pp.97-123, 1994.
DOI : 10.1016/0895-7177(94)90127-9
URL : https://hal.archives-ouvertes.fr/hal-00442810

C. Berge and E. Minieka, Graphs and hypergraphs North- Holland publishing company Amsterdam, 1973.

D. Le-berre and A. Parrain, The Sat4j library, release 2.2, Journal on Satisfiability Boolean Modeling and Computation, vol.7, pp.59-64, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00868136

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

C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh, Filtering Algorithms for the NValue Constraint, Constraints, vol.48, issue.22, p.271
DOI : 10.1007/s10601-006-9001-9
URL : https://hal.archives-ouvertes.fr/lirmm-00106098

C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh, The Slide Meta-Constraint, Proceedings of the 3dr International Workshop on Constraint Propagation and Implementation, 2006.

C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh, SLIDE: A Useful Special Case of the CARDPATH Constraint, Proceedings of the 18th European Conference on Artificial Intelligence, ECAI'08, pp.475-479, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00329876

C. Bessiere, E. Hebrard, B. Hnich, and T. Walsh, The Complexity of Reasoning with Global Constraints, Constraints, vol.1, issue.1???3, pp.239-259, 2007.
DOI : 10.1007/s10601-006-9007-3
URL : https://hal.archives-ouvertes.fr/lirmm-00195881

C. Bessiere, E. Hebrard, G. Katsirelos, Z. Kiziltan, É. Picard-cantin et al., The Balance Constraint Family, Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, pp.174-189, 2014.
DOI : 10.1007/978-3-319-10428-7_15
URL : https://hal.archives-ouvertes.fr/lirmm-01067459

C. Bessiere and P. Van-hentenryck, To Be or Not to Be ... a Global Constraint, Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming, CP'03, pp.789-794, 2003.
DOI : 10.1007/978-3-540-45193-8_54
URL : https://hal.archives-ouvertes.fr/lirmm-00269643

R. James, E. M. Bitner, and . Reingold, Backtrack programming techniques, Communications of the ACM, vol.18, issue.11, pp.651-656, 1975.

S. Boivin, M. Gravel, M. Krajecki, and C. Gagné, Résolution du problème de car-sequencing à l'aide d'une approche de type FC, Proceedings of Premières Journées Francophones de Programmation par Contraintes, JFPC'05, pp.11-20, 2005.

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.

N. Boysen and M. Fliedner, Comments on ???Solving real car sequencing problems with ant colony optimization???, European Journal of Operational Research, vol.182, issue.1, pp.466-468, 2007.
DOI : 10.1016/j.ejor.2006.07.012

S. Brand, N. Narodytska, C. Quimper, P. J. Stuckey, and T. Walsh, Encodings of the Sequence Constraint, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, CP'07, pp.210-224, 2007.
DOI : 10.1007/978-3-540-74970-7_17

P. Brucker, J. Hurink, B. Jurisch, and B. Wöstmann, A branch & bound algorithm for the open-shop problem, Discrete Applied Mathematics, vol.76, issue.1-3, pp.1-343, 1997.
DOI : 10.1016/S0166-218X(96)00116-3

H. Cambazard, Résolution de problèmes combinatoires par des approches fondées sur la notion d'explication, 2006.

H. Cambazard and N. Jussien, Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming, Constraints, vol.400, issue.1, pp.295-313, 2006.
DOI : 10.1007/s10601-006-9002-8
URL : https://hal.archives-ouvertes.fr/hal-00869105

H. Cambazard and N. Jussien, Solving the Minimum Number of Open Stacks Problem with Explanation-based Techniques, Proceedings of the 2nd International Workshop on Explanation-Aware Computing, ExaCt'07, pp.14-19, 2007.

H. Cambazard, O. Barry, and . Sullivan, A Reformulation-Based Approach to Explanation in Constraint Satisfaction, Proceedings of the 7th International Symposium on Abstraction, Reformulation, and Approximation, SARA'07, pp.395-396, 2007.
DOI : 10.1007/978-3-540-73580-9_32

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

A. Stephen and . Cook, The complexity of theorem-proving procedures, Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, STOC'71, Shaker Heights, pp.151-158, 1971.

M. James, A. B. Crawford, and . Baker, Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems, Proceedings of the 12th National Conference on Artificial Intelligence, AAAI'94, pp.1092-1097, 1994.

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557

J. De and K. , A Comparison of ATMS and CSP Techniques, Proceedings of the 11th International Joint Conference on Artificial Intelligence, IJCAI'89, pp.290-296, 1989.

R. Dechter, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, issue.3, pp.273-312, 1990.
DOI : 10.1016/0004-3702(90)90046-3

M. Dincbas, H. Simonis, and P. Van-hentenryck, Solving the Car- Sequencing Problem in Constraint Logic Programming, Proceedings of the 8th European Conference on Artificial Intelligence, ECAI'88, pp.290-295, 1988.

E. Heidi, M. L. Dixon, and . Ginsberg, Inference Methods for a Pseudo-Boolean Satisfiability Solver, Proceedings of the 18th National Conference on Artificial Intelligence, AAAI'02, and the 14th Conference on Innovative Applications of Artificial Intelligence, IAAI'02, pp.635-640, 2002.

N. Downing, T. Feydy, and P. J. Stuckey, Explaining alldifferent, Proceedings of the 35th Australasian Computer Science Conference, ACSC'12, pp.115-124, 2012.

N. Downing, T. Feydy, and P. J. Stuckey, Explaining Flow-Based Propagation, Proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR'12, pp.146-162, 2012.
DOI : 10.1007/978-3-642-29828-8_10

N. Eén and N. Sörensson, An Extensible SAT-solver, Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing, SAT'03, pp.502-518, 2003.

N. Eén and N. Sörensson, Translating Pseudo-Boolean Constraints into SAT, Journal on Satisfiability Boolean Modeling and Computation, vol.2, issue.1-4, pp.1-26, 2006.

B. Estellon and F. Gardi, Car sequencing is NP-hard: a short proof, Journal of the Operational Research Society, vol.191, issue.3, pp.1503-1504, 2013.
DOI : 10.1016/j.ejor.2007.04.033
URL : https://hal.archives-ouvertes.fr/hal-01198852

J. Fages, X. Lorca, and L. Rousseau, The salesman and the tree: the importance of search in CP, Constraints, vol.173, issue.18, pp.1-18, 2014.
DOI : 10.1007/s10601-014-9178-2
URL : https://hal.archives-ouvertes.fr/hal-01436214

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

M. S. Fox, N. M. Sadeh, and C. A. Baykan, Constrained Heuristic Search, Proceedings of the 11th International Joint Conference on Artificial Intelligence, IJCAI'89, pp.309-315, 1989.

K. G. , F. , and P. J. Stuckey, Explaining circuit propagation, Constraints, vol.19, issue.1, pp.1-29, 2014.

E. C. 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. C. 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

G. Gange, P. J. Stuckey, and P. Van-hentenryck, Explaining Propagators for Edge-Valued Decision Diagrams, Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming, CP'13, pp.340-355, 2013.
DOI : 10.1007/978-3-642-40627-0_28

G. Gange, P. J. Stuckey, and V. Lagoon, Fast Set Bounds Propagation Using a BDD-SAT Hybrid, Journal of Artificial Intelligence Research, vol.38, pp.307-338, 2010.

J. Gaschnig, A constraint satisfaction method for inference making, Proceedings of the 12th Annual Allerton Conference on Circuit Systems Theory, Illinois USA, pp.866-874, 1974.

P. A. Geelen, Dual viewpoint heuristics for binary constraint satisfaction problems, Proceedings of the 10th European Conference on Artificial Intelligence , ECAI'92, pp.31-35, 1992.

I. P. Gent, Optimal Implementation of Watched Literals and More General Techniques, Journal of Artificial Intelligence Research, vol.48, pp.231-251, 2013.

I. P. Gent, E. Macintyre, P. Prosser, B. M. Smith, and T. Walsh, An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem, Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming, CP'96, pp.179-193, 1996.
DOI : 10.1007/3-540-61551-2_74

I. P. Gent, I. Miguel, and N. C. Moore, Lazy Explanations for Constraint Propagators, Proceedings of the 12th International Symposium on Practical Aspects of Declarative Languages, PADL'10, pp.217-233, 2010.
DOI : 10.1007/978-3-642-11503-5_19

A. Gharbi and M. Labidi, Extending the Single Machine-Based Relaxation Scheme for the Job Shop Scheduling Problem, Electronic Notes in Discrete Mathematics, vol.36, issue.0, pp.1057-1064, 2010.
DOI : 10.1016/j.endm.2010.05.134

L. Matthew and . Ginsberg, Dynamic backtracking, Journal of Artificial Intelligence Research, vol.1, pp.25-46, 1993.

C. P. Gomes, B. Selman, and H. Kautz, Boosting Combinatorial Search Through Randomization, Proceedings of the 15th National Conference on Artificial Intelligence, AAAI'98, and the 10th Conference on Innovative Applications of Artificial Intelligence, IAAI'98, pp.431-437, 1998.

J. Gottlieb, M. Puchta, and C. Solnon, A Study of Greedy, Local Search, and Ant Colony Optimization Approaches for Car Sequencing Problems, Proceedings of Applications of Evolutionary Computing, EvoWorkshop'03, pp.246-257, 2003.
DOI : 10.1007/3-540-36605-9_23

D. Grimes and E. Hebrard, Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
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, 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

C. Guéret and C. Prins, A new lower bound for the open shop problem, Annals of Operations Research, vol.92, issue.0, pp.165-183, 1999.
DOI : 10.1023/A:1018930613891

M. Robert, G. L. Haralick, and . Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.

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

S. Jabbour, J. Lonlac, L. Sais, and Y. Salhi, Revisiting the Learned Clauses Database Reduction Strategies. CoRR, abs/1402, 1956.

R. Bayardo, J. , and R. C. Schrag, Using CSP Look-Back Techniques to Solve Real-World SAT Instances, Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, and the 9th Conference on Innovative

C. Lecoutre, L. Sais, S. Tabary, and V. Vidal, Recording and minimizing nogoods from restarts, Journal on Satisfiability Boolean Modeling and Computation, vol.1, issue.3-4, pp.147-167, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00191092

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

A. K. Mackworth, Consistency in networks of relations, Consistency in Networks of Relations, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

A. K. Mackworth, On Reading Sketch Maps, Proceedings of the 5th International Joint Conference on Artificial Intelligence, IJCAI'77, pp.598-606, 1977.

M. J. Maher, N. Narodytska, C. Quimper, and T. Walsh, Flow-Based Propagators for the SEQUENCE and Related Global Constraints, Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming, CP'08, pp.159-174, 2008.
DOI : 10.1007/978-3-540-85958-1_11
URL : http://arxiv.org/abs/0909.4452

V. Mayer-eichberger and T. Walsh, SAT Encodings for the Car Sequencing Problem, Proceedings of the 4th Pragmatics of SAT Workshop, POS'13, pp.15-27, 2013.

J. Menana and S. Demassey, Sequencing and Counting with the multicostregular Constraint, Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR'09, pp.178-192, 2009.
DOI : 10.1007/978-3-642-01929-6_14
URL : https://hal.archives-ouvertes.fr/hal-00394434

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

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

N. Narodytska, Reformulation of Global Constraints, 2011.

N. Narodytska, T. Petit, M. Siala, and T. Walsh, Three generalizations of the FOCUS constraint, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, IJCAI'13, pp.630-636, 2013.
DOI : 10.1007/s10601-015-9233-7
URL : https://hal.archives-ouvertes.fr/hal-00820894

R. Nieuwenhuis, A. Oliveras, and C. Tinelli, Solving SAT and SAT Modulo Theories, Journal of the ACM, vol.53, issue.6, pp.937-977, 2006.
DOI : 10.1145/1217856.1217859

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

O. Ohrimenko, P. J. Stuckey, and M. Codish, Propagation = Lazy Clause Generation, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, CP'07, pp.544-558, 2007.
DOI : 10.1007/978-3-540-74970-7_39
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.5471

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.8691

D. Bruce, W. C. Parrello, and . Kabat, Job-Shop Scheduling Using Automated Reasoning: A Case Study of the Car-Sequencing Problem, Journal of Automated Reasoning, vol.2, issue.1, pp.1-42, 1986.

G. Pesant, Constraint-Based Rostering, Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling, PATAT'98, 2008.

G. Pesant, C. Quimper, and A. Zanarini, Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems, Journal of Artificial Intelligence Research, vol.43, pp.173-210, 2012.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.3123

C. Prud-'homme, X. Lorca, and N. Jussien, Explanation-based large neighborhood search, Constraints, vol.19, issue.4, pp.339-379, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01087844

C. Quimper, A. Golynski, A. López-ortiz, and P. Van-beek, An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint, Constraints, vol.58, issue.2, pp.115-135, 2005.
DOI : 10.1007/s10601-005-0552-y

C. Quimper, A. López-ortiz, P. Van-beek, and A. Golynski, Improved Algorithms for the Global Cardinality Constraint, Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, pp.542-556, 2004.
DOI : 10.1007/978-3-540-30201-8_40

J. Régin, A Filtering Algorithm for Constraints of Difference in CSPs, Proceedings of the 12th National Conference on Artificial Intelligence, AAAI'94, pp.362-367, 1994.

J. Régin, Generalized Arc Consistency for Global Cardinality Constraint, Proceedings of the 13th National Conference on Artificial Intelligence, AAAI'96, and the 8th Conference on Innovative Applications of Artificial Intelligence , IAAI'96, pp.209-215, 1996.

J. Régin and J. Puget, A filtering algorithm for global sequencing constraints, Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming, CP'97, pp.32-46, 1997.
DOI : 10.1007/BFb0017428

T. Schiex and G. Verfaillie, Nogood recording for static and dynamic constraint satisfaction problems, International Journal of Artificial Intelligence Tools, vol.3, pp.48-55, 1993.

C. Schulte and M. Carlsson, Chapter 14 -finite domain constraint programming systems, Handbook of Constraint Programming, pp.495-526, 2006.
DOI : 10.1016/s1574-6526(06)80018-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.1268

C. Schulte and P. J. Stuckey, Efficient constraint propagation engines, ACM Transactions on Programming Languages and Systems, vol.31, issue.1, pp.1-2, 2008.
DOI : 10.1145/1452044.1452046
URL : http://arxiv.org/abs/cs/0611009

A. Schutt, T. Feydy, and P. J. Stuckey, Explaining

A. Schutt, T. Feydy, P. J. Stuckey, and M. Wallace, Why Cumulative Decomposition Is Not as Bad as It Sounds, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, CP'09, pp.746-761, 2009.
DOI : 10.1007/11493853_29

A. Schutt, T. Feydy, P. J. Stuckey, and M. 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

M. Siala, C. Artigues, and E. Hebrard, Two Clause Learning Approaches for Disjunctive Scheduling, Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming, p.15, 2015.
DOI : 10.1007/978-3-319-23219-5_28
URL : https://hal.archives-ouvertes.fr/hal-01229050

M. Siala, E. Hebrard, and M. Huguet, An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality, Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming, pp.55-69, 2012.
DOI : 10.1007/978-3-642-33558-7_7
URL : https://hal.archives-ouvertes.fr/hal-00713860

M. Siala, E. Hebrard, and M. Huguet, An optimal arc consistency algorithm for a particular case of sequence constraint, Constraints, vol.14, issue.2, pp.30-56, 2014.
DOI : 10.1007/s10601-013-9150-6
URL : https://hal.archives-ouvertes.fr/hal-00876594

M. Siala, E. Hebrard, and M. Huguet, A study of constraint programming heuristics for the car-sequencing problem, Engineering Applications of Artificial Intelligence, vol.38, pp.34-44, 2015.
DOI : 10.1016/j.engappai.2014.10.009
URL : https://hal.archives-ouvertes.fr/hal-01084239

P. M. João, K. A. Silva, and . Sakallah, GRASP -a New Search Algorithm for Satisfiability, Proceedings of the 1996 IEEE/ACM International Conference on Computer-aided Design, ICCAD'96, pp.220-227, 1996.

P. M. João, K. A. Silva, and . Sakallah, Grasp: a search algorithm for propositional satisfiability. Computers, IEEE Transactions on, vol.48, issue.5, pp.506-521, 1999.

P. M. João, I. Silva, and . Lynce, Towards robust CNF encodings of cardinality constraints, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, CP'07, pp.483-497, 2007.

H. Simonis, O. Barry, and . Sullivan, Search Strategies for Rectangle Packing, Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming, CP'08, pp.52-66, 2008.
DOI : 10.1007/978-3-540-85958-1_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.177.704

C. Sinz, Towards an Optimal CNF Encoding of Boolean Cardinality Constraints, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, CP'07, pp.827-831, 2005.
DOI : 10.1007/11564751_73

B. M. Smith, Succeed-first or Fail-first: A Case Study in Variable and Value Ordering, Research Report, vol.9626, 1996.

M. Barbara, S. A. Smith, and . Grant, Trying harder to fail first, Proceedings of the 13th European Conference on Artificial Intelligence, ECAI'98, pp.249-253, 1998.

F. Stephen, C. Smith, and . Cheng, Slack-based Heuristics for Constraint Satisfaction Scheduling, Proceedings of the 11th National Conference on Artificial Intelligence, AAAI'93, pp.139-144, 1993.

C. Solnon, . Van-dat, A. Cung, C. Nguyen, and . Artigues, The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF???2005 challenge problem, European Journal of Operational Research, vol.191, issue.3, pp.912-927, 2008.
DOI : 10.1016/j.ejor.2007.04.033
URL : https://hal.archives-ouvertes.fr/hal-00124828

N. Sörensson and A. Biere, Minimizing Learned Clauses, Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing, SAT'09, pp.237-243, 2009.
DOI : 10.1007/978-3-540-24605-3_37

M. Richard, G. J. Stallman, and . Sussman, Forward reasoning and dependencydirected backtracking in a system for computer-aided circuit analysis, Artificial Intelligence, vol.9, issue.2, pp.135-196, 1977.

É. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, issue.2, pp.278-285, 1993.
DOI : 10.1016/0377-2217(93)90182-M
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8802

N. Tamura, A. Taga, S. Kitagawa, and M. Banbara, Compiling finite linear CSP into SAT, Constraints, vol.64, issue.2, pp.254-272, 2009.
DOI : 10.1007/s10601-008-9061-0

W. Van-hoeve and I. Katriel, Global Constraints, Handbook of Constraint Programming, pp.169-208, 2006.
DOI : 10.1016/S1574-6526(06)80010-6

W. Jan-van-hoeve, G. Pesant, L. Rousseau, and A. Sabharwal, Revisiting the Sequence Constraint, Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming, CP'06, pp.620-634, 2006.
DOI : 10.1007/11889205_44

W. Jan-van-hoeve, G. Pesant, L. Rousseau, and A. Sabharwal, New filtering algorithms for combinations of among constraints, Constraints, vol.118, issue.12, pp.273-292, 2009.
DOI : 10.1007/s10601-008-9067-7

P. Vilím, Global Constraints in Scheduling, 2007.

P. Vilím, Edge Finding Filtering Algorithm for Discrete Cumulative Resources in O(kn log(n))gueret-prins/ for OSP Gueret&Prins instances. The option -type should have the value, Proceedings of the 15th International Conference on Principles ? data

@. and /. Taillard, The option -type should have the value

@. , /. , /. , /. Hurley-for, and O. Brucker, The option -type should have the value