1. R Baptiste and C. Le Pape, Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems, Con-straints, 5(1) (2000), 119–139.
2. R Baptiste, C. Le Pape and W. Nuijten, Constraint-based scheduling: applying constraint programming to scheduling problems. Kluwer, Boston (2001).
3. Y. Caseau and F. Laburthe, Improved CLP scheduling with task intervals, In P. A preliminary version of this paper was accepted to CPDP 2010 [5], Van Hentenryck (Ed.), ICLP1994—Logic Programming, MIT Press, Boston (1994), 369–383.
4. Gecode, a generic constraint development environment. Available from urlhttp://www.gecode.org . Accessed 30 August, (2010).
5. R. Kameugne and L. P. Fotso, A not-first/not-last algorithm for cumulative resource in O(n 2 log n), Accepted to CPDP 2010 Doctoral Program, St Andrews, Scotland (2010).