L. Parties, A) et (B) représentent respectivement la position au plus tôt de chacune des tâches ainsi que le PPO sur les ressources r 0 et r 1 , (A) du problème initial décrit dans l'exemple 6.1, (B) une fois le point fixe atteint, p.47

L. Parties, A) et (B) représentent respectivement la position au plus tôt de chacune des tâches ainsi que le PPO, (A) du problème initial décrit dans l'exemple 8.3, (B) la solution obtenue par l'algorithme glouton, p.89

A. Bibliographie-aggoun and N. Beldiceanu, Time stamps techniques for the trailed data in constraint logic programming systems, SPLT'90, 8 ème Séminaire Programmation en Logique, pp.487-510, 1990.

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

K. Baker, Introduction to sequencing and scheduling, p.15, 1974.

P. Baptiste, L. Pape, C. Nuijten, and W. , Constraint-based scheduling : applying constraint programming to scheduling problems, International Series in Operations Research and Management Science. kluwer, vol.39, issue.16, p.17, 2001.
DOI : 10.1007/978-1-4615-1479-4

URL : https://hal.archives-ouvertes.fr/inria-00123562

N. Beldiceanu, Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type, p.74, 2000.
DOI : 10.1007/3-540-45349-0_6

N. Beldiceanu, Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family, Principles and Practice of Constraint Programming 7th International Conference, pp.211-224, 2001.
DOI : 10.1007/3-540-45578-7_15

N. Beldiceanu and M. Carlsson, Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint, Principles and Practice of Constraint Programming (CP'01, 7th International Conference, pp.377-391, 2001.
DOI : 10.1007/3-540-45578-7_26

N. Beldiceanu and M. Carlsson, A New Multi-resource cumulatives Constraint with Negative Heights, 8th International Conference, pp.63-79, 2002.
DOI : 10.1007/3-540-46135-3_5

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

N. Beldiceanu, M. Carlsson, S. Demassey, and E. Poder, New filtering for the cumulative constraint in the context of non-overlapping rectangles, Annals of Operations Research, vol.118, issue.1???4, pp.27-50, 2011.
DOI : 10.1007/s10479-010-0731-0

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

N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson, On the reification of global constraints, Constraints, vol.13, issue.3, pp.1-6, 2013.
DOI : 10.1007/s10601-012-9132-0

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

N. Beldiceanu, M. Carlsson, and E. Poder, New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, pp.21-35, 2008.
DOI : 10.1007/978-3-540-68155-7_5

N. Beldiceanu, M. Carlsson, E. Poder, R. Sadek, and C. Truchet, A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects, Principles and Practice of Constraint Programming 13th International Conference, pp.180-194, 2007.
DOI : 10.1007/978-3-540-74970-7_15

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

N. Beldiceanu, M. Carlsson, and S. Thiel, Sweep synchronization as a global propagation mechanism, Computers & Operations Research, vol.33, issue.10, pp.2835-2851, 2006.
DOI : 10.1016/j.cor.2005.01.013

C. Bessière, E. Hebrard, B. , H. K?z?ltan, Z. Walsh et al., Filtering Algorithms for the NValue Constraint, Lecture Notes in Computer Science, vol.3524, pp.79-93, 2005.
DOI : 10.1007/11493853_8

C. Bessière, E. Hebrard, B. , H. K?z?ltan, Z. Walsh et al., Filtering Algorithms for the NValue Constraint, Lecture Notes in Computer Science, vol.3524, pp.79-93, 2005.
DOI : 10.1007/11493853_8

C. Bessière and P. Van-hentenryck, To Be or Not to Be ... a Global Constraint, Principles and Practice of Constraint Programming (CP'03), 9th International Conference, pp.789-794, 2003.
DOI : 10.1007/978-3-540-45193-8_54

J. Carlier and E. Pinson, Adjustment of heads and tails for the job-shop problem, European Journal of Operational Research, vol.78, issue.2, pp.146-161, 1994.
DOI : 10.1016/0377-2217(94)90379-4

M. Carlsson, SICStus Prolog User's Manual. SICS, 4.2.3 edn, p.101, 2012.

Y. Caseau and F. Laburthe, Improved clp scheduling with task intervals, Proceedings of the Eleventh International Conference on Logic Programming (ICLP'94), pp.369-383, 1994.

Y. Caseau and F. Laburthe, Cumulative scheduling with task intervals, Proceedings of the 1996 Joint International Conference and Syposium on Logic Programming (JICSLP'96), pp.363-377, 1996.

G. G. Chu, Improving combinatorial optimization, p.14, 2011.

M. Dawande, J. Kalagnanam, and J. Sethuraman, Variable Sized Bin Packing With Color Constraints, Electronic Notes in Discrete Mathematics, vol.7, issue.74, pp.154-157, 2001.
DOI : 10.1016/S1571-0653(04)00248-3

D. Berg, M. Van-kreveld, M. Overmars, M. Schwarzkopf, and O. , Computational geometry -algorithms and applications, p.18, 1997.

J. Erschler, P. Lopez, and C. Thuriot, Raisonnement temporel sous contraintes de ressources et problèmes d'ordonnancement. Revue d, Intelligence Artificielle, vol.5, issue.16, pp.7-36, 1991.

E. Freuder, In pursuit of the holy grail, ACM Computing Surveys, vol.28, issue.4es, pp.57-61, 1997.
DOI : 10.1145/242224.242304

A. Frisch, I. Miguel, and T. Walsh, Modelling a steel mill slab design problem, Proceedings of the (IJCAI'01) Workshop on Modelling and Solving Problems with Constraints, pp.39-45, 2001.

A. Frisch, I. Miguel, and T. Walsh, Symmetry and implied constraints in the steel mill slab design problem, Proceedings of the (CP'01) Workshop on modelling and problem formulation, pp.8-15, 2001.

M. R. Garey and D. S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, p.74, 1979.

A. Gargani and P. Refalo, An Efficient Model and Strategy for the Steel Mill Slab Design Problem, Principles and Practice of Constraint Programming 13th International Conference, pp.77-89, 2007.
DOI : 10.1007/978-3-540-74970-7_8

I. Gent and T. Walsh, Csplib : A benchmark library for constraints. Tech. rep., Technical report APES-09-1999 Available from http, A shorter version appears in the Proceedings of the 5th International Conference on Principles and Practices of Constraint Programming (CP'99, p.77, 1999.

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Ann. Discrete Math, vol.4, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

S. Heinz, T. Schlechte, R. Stephan, and M. Winkler, Solving steel mill slab design problems, Constraints, vol.16, issue.1, pp.39-50, 2012.
DOI : 10.1007/s10601-011-9113-8

URL : http://edok01.tib.uni-hannover.de/edoks/e01fn13/73345139X.pdf

F. Hermenier, S. Demassey, and X. Lorca, Bin Repacking Scheduling in Virtualized Datacenters, Principles and Practice of Constraint Programming 17th International Conference, pp.27-41, 2011.
DOI : 10.1007/978-3-642-23786-7_5

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

B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh, Hybrid Modelling for Robust Solving, Annals of Operations Research, vol.130, issue.1-4, pp.19-39, 2004.
DOI : 10.1023/B:ANOR.0000032568.51115.0d

J. Hooker, Integrated Methods for Optimization. International series in operations research & management science, p.14, 2007.

R. Kameugne, L. Fotso, J. Scott, and Y. Ngo-kateu, A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints, Principles and Practice of Constraint Programming 17th International Conference, pp.478-492, 2011.
DOI : 10.1007/978-3-642-23786-7_37

F. Laburthe, Choco : implementing a cp kernel, Proceedings of the CP'00 post conference workshop on techniques for implementing constraint programming systems, p.57, 2000.

M. Lagerkvist and C. Schulte, Propagator Groups, Principles and Practice of Constraint Programming 15th International Conference, pp.524-538, 2009.
DOI : 10.1007/3-540-61708-6_78

A. Lahrichi, Ordonnancements. La notion de "parties obligatoires" et son application aux problèmes cumulatifs. RAIRO -Operations Research, Recherche Opérationnelle, vol.16, issue.3, pp.241-262, 1982.

L. Pape and C. , Des systèmes d'ordonnancement flexibles et opportunistes, French 7, p.18, 1988.

A. Letort, N. Beldiceanu, and M. Carlsson, A Scalable Sweep Algorithm for the cumulative Constraint, Principles and Practice of Constraint Programming -18th International Conference (CP'12), pp.439-454, 2012.
DOI : 10.1007/978-3-642-33558-7_33

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

A. Letort, M. Carlsson, and N. Beldiceanu, A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint, 10th International ConferenceCPAIOR'13), pp.144-159, 2013.
DOI : 10.1007/978-3-642-38171-3_10

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

P. Lopez, Approche énergétique pour l'ordonnancement de tâches sous contraintes de temps et de ressources, French 7, p.17, 1991.

P. Lopez, J. Erschler, and P. Esquirol, Ordonnancement de tâches sous contraintes : une approche énergétique, pp.453-481, 1992.

L. Mercier and P. Van-hentenryck, Edge Finding for Cumulative Scheduling, INFORMS Journal on Computing, vol.20, issue.1, pp.143-153, 2008.
DOI : 10.1287/ijoc.1070.0226

L. Michel and P. Van-hentenryck, Comet in context, Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday, PCK50, pp.95-107, 2003.
DOI : 10.1145/778348.778361

W. Nuijten, Time and resource constrained scheduling : A constraint satisfaction approach, p.17, 1994.

W. Nuijten and E. Aarts, Constraint satisfaction for multiple capacitated job shop scheduling, Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI'94), pp.635-639, 1994.

W. Nuijten and E. Aarts, A computational study of constraint satisfaction for multiple capacitated job shop scheduling, European Journal of Operational Research, vol.90, issue.2, pp.269-284, 1996.
DOI : 10.1016/0377-2217(95)00354-1

O. Sullivan and B. , CP'11 panel position -the future of constraint programing, p.7, 2011.

F. Pachet and P. Roy, Automatic Generation of Music Programs, Principles and Practice of Constraint Programming (CP'99) 5th International Conference, pp.331-345, 1999.
DOI : 10.1007/978-3-540-48085-3_24

L. Perron, P. Shaw, and V. Furnon, Propagation Guided Large Neighborhood Search, Principles and Practice of Constraint Programming 10th International Conference, pp.468-481, 2004.
DOI : 10.1007/978-3-540-30201-8_35

G. Pesant, Counting solutions of csps : A structural approach, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), pp.260-265, 2005.

T. Petit, Intermediary local consistencies, European Conference on Artificial Intelligence ECAI'12), pp.919-920, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00753664

R. , K. Sprecher, and A. , PSPLib ? a project scheduling problem library, European journal of operational research, vol.96, issue.87, pp.205-216, 1996.

J. Régin, A filtering algorithm for constraints of difference in csps, Proceedings of the 12th National Conference on Artificial Intelligence, pp.362-367, 1994.

J. Régin and M. Rezgui, Discussion about constraint programming bin packing models, AI for Data Center Management and Cloud Computing, Papers from the 2011 AAAI Workshop, AAAI Workshops, pp.11-19, 2011.

. Roadef, Challenge 2012 machine reassignment (2012) URL http://challenge.roadef.org, p.46, 2012.

P. Schaus, J. Monette, L. Michel, P. Van-hentenryck, C. Coffrin et al., Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS, Constraints, vol.16, issue.2, pp.125-147, 2011.
DOI : 10.1007/s10601-010-9100-5

C. Schulte, Comparing trailing and copying for constraint programming, Logic Programming : The 1999 International Conference (ICLP'99), pp.275-289, 1999.

C. Schulte and P. Stuckey, Efficient constraint propagation engines, ACM Transactions on Programming Languages and Systems, vol.31, issue.1, pp.611009-57, 2006.
DOI : 10.1145/1452044.1452046

URL : http://arxiv.org/abs/cs/0611009

A. Schutt, T. Feydy, P. J. , and S. , Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint, 10th International ConferenceCPAIOR'13), pp.234-250, 2013.
DOI : 10.1007/978-3-642-38171-3_16

A. Schutt and A. Wolf, A New ${\mathcal O}(n^2\log n)$ Not-First/Not-Last Pruning Algorithm for Cumulative Resource Constraints, Principles and Practice of Constraint Programming 16th International Conference, pp.445-459, 2010.
DOI : 10.1007/978-3-642-15396-9_36

A. Schutt, A. Wolf, and G. Schrader, Not-First and Not-Last Detection for Cumulative Scheduling in ${\cal O}(n^3\log n)$, 16th International Conference on Applications of Declarative Programming and Knowledge Management (INAP'05), pp.66-80, 2005.
DOI : 10.1007/11963578_6

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Principles and Practice of Constraint Programming (CP'98), 4th International Conference, pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30

H. Simonis, An industrial benchmark, p.46, 2013.

M. Sindelar, R. Sitaraman, and P. Shenoy, Sharing-aware algorithms for virtual machine colocation, Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, SPAA '11, pp.367-378, 2011.
DOI : 10.1145/1989493.1989554

C. Team, Choco : An open source java CP library. research report 10-02-info, Ecole des Mines de, Nantes, vol.27, p.101, 2010.

P. Van-hentenryck and L. Michel, The Steel Mill Slab Design Problem Revisited, 5th International Conference, pp.377-381, 2008.
DOI : 10.1007/978-3-540-68155-7_41

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

P. Vilím, Timetable edge finding filtering algorithm for discrete cumulative resources Principles and Practice of Constraint Programming, 17th International Conference, pp.230-245, 2011.

A. Wolf and G. Schrader, O(n logn) overload checking for the cumulative constraint and its application Declarative Programming for Knowledge Management, 16th International Conference on Applications of Declarative Programming and Knowledge Management (INAP'05), Lecture Notes in Computer Science, pp.88-101, 2005.

T. Wood, G. Tarasuk-levin, P. Shenoy, P. Desnoyers, E. Cecchet et al., Memory buddies, ACM SIGOPS Operating Systems Review, vol.43, issue.3, pp.27-36, 2009.
DOI : 10.1145/1618525.1618529