1. Aggoun, A. and N. Beldiceanu. 1993. Extending CHIP in Order to Solve Complex Scheduling and Placement Problems. Mathematical and Computer Modelling 17, 57–73.
2. Applegate, D. and W. Cook. 1991. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing 3,149–156.
3. Baptiste, P. and C. Le Pape. 1995. A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. In Proceedings of the l4th International Joint Conference on Artificial Intelligence. Montreal.
4. Baptiste, P. AND C. Le Pape. 1996. Edge-finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling. In Proceedings of the 15th Workshop of the U.K. Planning Special Interest Group. Liverpool, UK.
5. Baptiste, P., C. Le Pape and W. P. Nuuten}. 1998. Satisfiability Tests and Time-Bound Adjustments for Cumulative Scheduling Problems. Research report, Univer-sité de Technologie de Compiègne.