1. A. Aggoun and N. Beldiceanu [1993], Extending CHIP in Order to Solve Complex Scheduling and Placement Problems, Mathematical and Computer Modeling 17:57–73.
2. D. Applegate and W. Cook [1991], A Computational Study of the Job-Shop Scheduling Problem, ORSA Journal on Computing 3(2):149–156.
3. Ph. Baptiste and C. Le Pape [1995], A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling, Proc. 14th International Joint Conference on Artificial Intelligence.
4. Ph. Baptiste [1998], An O(n4) Algorithm for Preemptive Scheduling of a Single Machine to Minimize the Number of Late Jobs, Technical Report 98/98, Université de Technologie de Compiègne.
5. S. Bistarelli, U. Montanari and F. Rossi [1995], Constraint Solving over Semirings, Proc. 14th International Joint Conference on Artificial Intelligence.