1. Baptiste, P., Le Pape, C., 1995. A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In: Mellish, C.S. (Ed.), Proceedings of The 14th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, Palo Alto, CA, pp. 600–606
2. Baptiste, P., Le Pape, C., Nuijten, W.P.M., 1995. Constraint-based optimization and approximation for job shop scheduling. In: Sadeh, N. (Ed.), Proceedings of The AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems (IJCAI-95), http://www.ilog.com.sg/html/products/optimization/research_papers.htm
3. Branch and infer: A unifying framework for integer and finite domain constraint programming;Bockmayr;INFORMS Journal on Computing,1998
4. An algorithm for solving the job-shop problem;Carlier;Management Science,1989
5. Integrating constraint logic programming and operations research techniques for the crew rostering problem;Caprara;Software – Practice & Experience,1998