Abstract
This paper presents the 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.
Preview
Unable to display preview. Download preview PDF.
References
H. Aït-Kaci, A. Podelski. The Meaning of Life. PRL Research Report, DEC, 1990.
A. Agoun, N. Beldiceanu: Overview of the CHIP Compiler. Proc. of the 8th ICLP, Paris, 1991.
Y. Caseau. A Formal System for Producing Demons from Rules. Proc. of DOOD89, Kyoto 1989.
Y. Caseau. An Object-Oriented Deductive Language. Annals of Mathematics and Artificial Intelligence, special issue on deductive databases, March 1991.
Y. Caseau. Constraints in an Object-Oriented Deductive Database. Proc. of DOOD91, Munich, 1991.
M. Carter. A Survey of Practical Applications of Examination Timetabling Algorithms. Operations Research 34, 1986.
Y. Caseau, P. Koppstein. A Rule-Based Approach to a Time-Constrained Traveling Salesman Problem. Presented at the Second International Symposium on Artificial Intelligence and Mathematics, January 1992, to appear.
E. Lawler, J. Lenstra, A. Rinnooy, D. Shmoys (eds.). The Traveling Salesman Problem: a Guided Tour of Combinatorial Optimization. Wiley, Chichester, 1985.
T. McClain, Mazzola. Operations Management. Prentice Hall, 1992.
B. Meyer: Object-oriented Software Construction. Prentice Hall, 1988.
R. Nanda, J. Browner. Introduction to Employee Scheduling. Van Nostrand Reinhold, 1992.
J.F. Puget, P. Albert. PECOS: programmation par contraintes orientée objets. Génie Logiciel et Systèmes Experts, vol. 23, 1991.
M. Savelsbergh. The vehicle routing problem with time windows: minimizing route duration. Ann. Oper. Res. 4, 1986.
P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT press, Cambridge, 1989.
P. Van Hentenryck, Y. Deville. The Cardinality Operator: A New Logical Connective for Constraint Logic Programming. Proc. of the 8th ICLP, Paris, 1991.
D. de Werra. An introduction to timetabling. European Journal of Operational Research, 19, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caseau, Y., Guillo, PY., Leveriez, E. (1993). A deductive and object-oriented approach to a complex scheduling problem. In: Ceri, S., Tanaka, K., Tsur, S. (eds) Deductive and Object-Oriented Databases. DOOD 1993. Lecture Notes in Computer Science, vol 760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57530-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-57530-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57530-6
Online ISBN: 978-3-540-48212-3
eBook Packages: Springer Book Archive