. Tab, 2 ? Algorithme Balayage (AB) -Calcule P cm(r) pour une ressource donnée r

C. La-capacité-de-la-ressource, . Autrement, and . Delay, 1 : k ? 1 ; sum h r ? 0 ; sum sl r ? 0 ; 2 : Extrait, s'il existe, le premierévènementpremierévènement e de L events tel que r ? a T e.tache ; 3 : ? ? e.date ; 4 : tant que e est défini faire 5 : | si e.date = ? alors /* ? vient juste de bouger : Calcule le k eme trapèze de P cm(r) */ 6 : | | st ? ?; sh ? sum h r ; d ? e.date ? ? ; eh ? sum sl r * (e.date ? ?) + sum h r ; 7 : | | si sh > C r ? eh > C r alors retourne Fail ; /* P cm(r) k dépasse Cr */ 8 : | | P cm(r) k ? (st, sh, e.date, eh) ; k ? k + 1 ; 9 : | | sum h r ? eh; ? ? e.date

Y. Caseau and F. Laburthe, Cumulative Scheduling with Task Intervals, Proceedings of the Joint International Conference and Symposium on Logic Programming, 1996.

W. Herroelen, E. Demeulemeester, D. Reyck, and B. , A Classification Scheme for Project Scheduling Problems Project Scheduling Recent Models, Algorithms and Applications, pp.1-26, 1998.

R. Klein and A. Scholl, Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling, European Journal of Operational Research, vol.112, issue.2, pp.322-346, 1999.
DOI : 10.1016/S0377-2217(97)00442-6

A. Lahrichi, Scheduling : the Notions of Hump, Compulsory Parts and their Use in Cumulative Problems, C. R. Acad. Sci. Paris, t, vol.294, pp.209-211, 1982.

P. Laborie, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, Artificial Intelligence, vol.143, issue.2, pp.151-188, 2003.
DOI : 10.1016/S0004-3702(02)00362-4

C. T. Maravelias and I. E. Grossmann, A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants, Computers & Chemical Engineering, vol.28, issue.10, pp.1921-1949, 2004.
DOI : 10.1016/j.compchemeng.2004.03.016

N. Muscettola, Computing the Envelope for Stepwise-Constant Resource Allocations, LNCS, vol.470, pp.139-153, 2002.
DOI : 10.1007/3-540-46135-3_10

E. Poder, N. Beldiceanu, and E. Sanlaville, Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption, European Journal of Operational Research, vol.153, issue.1, pp.239-254, 2004.
DOI : 10.1016/S0377-2217(02)00756-7
URL : https://hal.archives-ouvertes.fr/hal-00442833

F. P. Preparata, I. Shamos, and M. , Computational Geometry, An introduction. Texts and Monographs in Computer Science, 1995.

F. Sourd and J. Rogerie, Continuous Filling and Emptying of Storage Systems in Constraint- Based Scheduling. 8th International Workshop on Project Management and Scheduling -MPS, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01185227

A. Wolf, Filtering while Sweeping over Task Intervals, LNCS, vol.2833, pp.739-753, 2003.
DOI : 10.1007/978-3-540-45193-8_50