1. Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57–73.
2. Baptiste, P., & Le Pape, C. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5(1/2), 119–139.
3. Baptiste, P., & Demassey, S. (2004). Tight LP bounds for resource constrained project scheduling. OR-Spektrum, 26, 251–262.
4. Beldiceanu, N. (1990). An example of introduction of global constraints in CHIP: Application to block theory problems. Technical report TR-LP-49, ECRC, Munich.
5. Beldiceanu, N. (2000). Global constraints as graph properties on a structured network of elementary constraints of the same type. In R. Dechter (Ed.), Principles and practice of Constraint Programming (CP’2000), volume 1894 of LNCS (pp. 52–66). Berlin Heidelberg New York: Springer. Preprint available as SICS Tech Report T2000-01.