Journal of Intelligent Information Systems

, Volume 4, Issue 2, pp 149–166 | Cite as

A deductive and object-oriented approach to a complex scheduling problem

  • Yves Caseau
  • Pierre -Yves Guillo
  • Eric Levenez


This paper presents an application of combined deductive and object-oriented technologies to a complex scheduling (timetable) problem. This approach emphasizes local propagation of constraints, which we perform with deductive rules, and combines it with global pruning heuristics, which we represent with methods (in a procedural manner) attached to objects. Because both components are essential to ensure success, we see this scheduling application as an interesting demonstration of the synergy between object-oriented and deductive technology. We provide a precise description of the problem, discuss what makes it difficult, and present detailed techniques that we used for its resolution.


constraint satisfaction object-oriented languages inference rules timetable scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aït-Kaci, H. and Podelski, A. (1990).The Meaning of Life. PRL Research Report, DEC.Google Scholar
  2. Agoun, A. and Beldiceanu, N. (1991). Overview of the CHIP Compiler.Proc. of the 8th ICLP, Paris.Google Scholar
  3. Caseau, Y. (1989). A Formal System for Producing Demons from Rules.Proc. of DOOD89, Kyoto.Google Scholar
  4. Caseau, Y. (1991). An Object-Oriented Deductive Language.Annals of Mathematics and Artificial Intelligence, special issue on deductive databases.Google Scholar
  5. Caseau, Y. (1991). Constraints in an Object-Oriented Deductive Database.Proc. of DOOD91, Munich.Google Scholar
  6. Caseau, Y. and Laburthe, F. Improved CLP Scheduling with Tasks Intervals.Proc. of the 11th International Conference on Logic Programming, MIT Press, June 1994.Google Scholar
  7. Carter, M. (1986). A Survey of Practical Applications of Examination Timetabling Algorithms. Operations Research 34.Google Scholar
  8. Caseau, Y. and Koppstein, P. (1992). A Rule-Based Approach to a Time-Constrained Traveling Salesman Problem. Presented at the Second International Symposium on Artificial Intelligence and Mathematics, to appear.Google Scholar
  9. Lawler, E., Lenstra, J. Rinnooy, A., and Shmoys, D. (eds.) (1985).The Traveling Salesman Problem: a Guided Tour of Combinatorial Optimization. Wiley, Chichester.Google Scholar
  10. McClain, T. and Mazzola (1992).Operations Management. Prentice Hall.Google Scholar
  11. Meyer, B. (1988).Object-oriented Software Construction. Prentice Hall.Google Scholar
  12. Nanda, R. and Browner, J. (1992).Introduction to Employee Scheduling. Van Nostrand Reinhold.Google Scholar
  13. Puget, J. F. and Albert, P. (1991) PECOS: programmation par contraintes orientée objets. Génie Logiciel et Systémes Experts, vol. 23.Google Scholar
  14. Savelsbergh, M. (1986). The vehicle routing problem with time windows: minimizing route duration.Ann. Oper. Res. 4.Google Scholar
  15. Van Hentenryck, P. (1989).Constraint Satisfaction in Logic Programming. The MIT press, Cambridge.Google Scholar
  16. Van Hentenryck, P. and Deville, Y. (1991). The Cardinality Operator: A New Logical Connective for Constraint Logic Programming.Proc. of the 8th ICLP, Paris.Google Scholar
  17. de Werra, D. An introduction to timetabling.European Journal of Operational Research, 19.Google Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Yves Caseau
    • 1
  • Pierre -Yves Guillo
    • 2
  • Eric Levenez
    • 3
  1. 1.BellcoreMorristownUSA
  2. 2.Nynex Science and TechnologyWhite PlainsUSA
  3. 3.Ecole Centrale de LyonEcullyFrance

Personalised recommendations