Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aït-Kaci, H. and Podelski, A. (1990).The Meaning of Life. PRL Research Report, DEC.
Agoun, A. and Beldiceanu, N. (1991). Overview of the CHIP Compiler.Proc. of the 8th ICLP, Paris.
Caseau, Y. (1989). A Formal System for Producing Demons from Rules.Proc. of DOOD89, Kyoto.
Caseau, Y. (1991). An Object-Oriented Deductive Language.Annals of Mathematics and Artificial Intelligence, special issue on deductive databases.
Caseau, Y. (1991). Constraints in an Object-Oriented Deductive Database.Proc. of DOOD91, Munich.
Caseau, Y. and Laburthe, F. Improved CLP Scheduling with Tasks Intervals.Proc. of the 11th International Conference on Logic Programming, MIT Press, June 1994.
Carter, M. (1986). A Survey of Practical Applications of Examination Timetabling Algorithms. Operations Research 34.
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.
Lawler, E., Lenstra, J. Rinnooy, A., and Shmoys, D. (eds.) (1985).The Traveling Salesman Problem: a Guided Tour of Combinatorial Optimization. Wiley, Chichester.
McClain, T. and Mazzola (1992).Operations Management. Prentice Hall.
Meyer, B. (1988).Object-oriented Software Construction. Prentice Hall.
Nanda, R. and Browner, J. (1992).Introduction to Employee Scheduling. Van Nostrand Reinhold.
Puget, J. F. and Albert, P. (1991) PECOS: programmation par contraintes orientée objets. Génie Logiciel et Systémes Experts, vol. 23.
Savelsbergh, M. (1986). The vehicle routing problem with time windows: minimizing route duration.Ann. Oper. Res. 4.
Van Hentenryck, P. (1989).Constraint Satisfaction in Logic Programming. The MIT press, Cambridge.
Van Hentenryck, P. and Deville, Y. (1991). The Cardinality Operator: A New Logical Connective for Constraint Logic Programming.Proc. of the 8th ICLP, Paris.
de Werra, D. An introduction to timetabling.European Journal of Operational Research, 19.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Caseau, Y., Guillo, P.Y. & Levenez, E. A deductive and object-oriented approach to a complex scheduling problem. J Intell Inf Syst 4, 149–166 (1995). https://doi.org/10.1007/BF00961872
Issue Date:
DOI: https://doi.org/10.1007/BF00961872