1. A computational study of the job-shop scheduling problem;Applegate;ORSA Journal of Computing,1991
2. Baptiste, P (1995). Resource constraints for preemptive and non-preemptive scheduling. Master's Thesis. University of Paris VI.
3. An O (n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs;Baptiste;Operations Research Letters,1999
4. Proceedings of the 14th International Conference on Artificial Intelligence;Baptiste,1995
5. Raisonnement temporel sous contraintes de ressource et problemes d'ordonnancement;Erschler;Revue d'Intelligence Aritificielle,1991