University timetabling using constraint logic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1551 LNCS, Issue , 1999, Pages 320-334

  Goltz, Hans Joachim ^a   Matzke, Dirk ^a  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPTUAL CHANGE; CONSTRAINT LOGIC PROGRAMMING; ESSENTIAL COMPONENT; HARD CONSTRAINTS; HEURISTIC SOLUTIONS; TIMETABLING; TIMETABLING PROBLEM; UNIVERSITY COURSE; UNIVERSITY TIMETABLING; USER REQUIREMENTS;

CURRICULA; TEACHING;

SCHEDULING;

EID: 22444452545     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. S. Abdennadher and M. Marte. University timetabling using constraint handling rules. In O. Ridoux, editor, Proc. JFPLC'98, Journées Francophones de Programmation Logique et Programmation par Constraintes, pages 39-49, Paris, 1998. Hermes.
2. A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. J. Mathematical and Computer Modelling, 17(7):57-73, 1993.
3. F. Azevedo and P. Barahona. Timetabling in constraint logic programming. In Proc. World Congress on Expert Systems, 1994.
4. E. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. J. Mathematical and Computer Modelling, 20(12):97-123, 1994.
5. P. Boizumault, Y. Delon, and L. Peridy. Constraint logic programming for examination timetabling. J. Logic Programming, 26(2):217-233, 1996.
6. E. Burke and M. Carter, editors. Practice and Theory of Automated Timetabling II, volume 1408 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, 1998.
7. E. Burke, D. Eiiliman, P. Ford, and R. Weare. Examination timetabling in British universities: A survey. In [8], pages 76-90, 1996.
8. E. Burke and P. Ross, editors. Practice and Theory of Automated Timetabling, volume 1153 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, 1996.
9. T. B. Cooper and J. H. Kingston. The complexity of timetable construction problems. In [8], pages 183-295, 1996.
10. M. Dincbas, P. van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The constraint logic programming language CHIP. In Int. Conf. Fifth Generation Computer Systems (FGCS'88), pages 693-702, Tokyo, 1988.
11. T. Frühwirth. Theory and practice of constraint handling rules. J. Logic Programming, 37:95-138, 1998.
12. H.-J. Goltz. Reducing domains for search in CLP(FD) and its application to jobshop scheduling. In U. Montanari and F. Rossi, editors, Principles and Practice of Constraint Programming - CP'95, volume 976 of Lecture Notes in Computer Science, pages 549-562, Berlin, Heidelberg, 1995. Springer-Verlag.
13. C. Guéret, N. Jussien, P. Boizumault, and C. Prins. Building university timetables using constraint logic programming. In [8], pages 130-145, 1996.
14. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (Mass.), London, 1989.
15. M. Henz and J. Würtz. Using Oz for college timetabling. In [8], pages 162-177, 1996.
16. M. Kambi and D. Gilbert. Timetabling in constraint logic programming. In Proc. 9th Symp. on Industrial Applications of PROLOG (INAP'96), Tokyo, Japan, 1996.
17. G. Lajos. Complete university modular timetabling using constraint logic programming. In [8], pages 146-161, 1996.
18. K. Marriott and P. J. Stucky. Programming with Constraints: An Introduction. The MIT Press, Cambridge (MA), London, 1998.
19. A. Schaerf. A survey of automated timetabling. Technical Report CS-R9567, Centrum voor Wiskunde en Informatica, 1995.
20. G.M. White and J. Zhang. Generating complete university timetables by combining tabu search with constraint logic. In [6], pages 187-198, 1998.