University course timetabling with soft constraints

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

Volumn 2740, Issue , 2003, Pages 310-328

  Rudová, Hana ^a   Murray, Keith ^b  

^a MASARYK UNIVERSITY   (Czech Republic)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; PETROLEUM REFINING; SCHEDULING;

COMPUTATIONAL RESULTS; CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT PROPAGATION; HARD CONSTRAINTS; PURDUE UNIVERSITY; SEARCH ALGORITHMS; SOLUTION APPROACH; UNIVERSITY COURSE TIMETABLING;

CONSTRAINT THEORY;

EID: 35248845686     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45157-0_21     Document Type: Article

References (29)

1. Abdennadher, S., Marte, M.: University Course Timetabling Using Constraint Handling Rules. J. Appl. Artif. Intell. 14 (2000) 311-326
2. Aubin, J., Ferland, J.A.: A Large Scale Timetabling Problem. Comput. Oper. Res. 16 (1989) 67-77
3. Banks, D., van Beek, P., Meisels, A.: A Heuristic Incremental Modeling Approach to Course timetabling. In: Proc. Artif. Intell. '98 (Canada) (1998)
4. Bistarelli, S., Frühwirth, T., Martel, M., Rossi, F.: Soft Constraint Propagation and Solving in Constraint Handling Rules. In: Proc. ACM Symp. Appl. Comput. (2002.)
5. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-Based Constraint Solving and Optimization. J. ACM 44 (1997) 201-236
6. Carlsson, M., Ottosson, G., Carlson, B.: An Open-Ended Finite Domain Constraint Solver. In: Programming Languages: Implementations, Logics and Programming. Lecture Notes in Computer Science, Vol. 1292. Springer-Verlag, Berlin Heidelberg New York (1997)
7. Carter, M.W.: A Comprehensive Course Timetabling and Student Scheduling System at the University of Waterloo. In: Burke, E, Erben W. (Eds.): Practice and Theory of Automated Timetabling III (PATAT 2000, Konstanz, Germany, August, selected papers). Lecture Notes in Computer Science, Vol. 2079. Springer-Verlag, Berlin Heidelberg New York (2001) 64-82
8. Carter, M.W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E, Carter, M. (Eds.): Practice and Theory of Automated Timetabling II (PATAT 1997, Toronto, Canada, August, selected papers). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 3-19
9. Dubois, D., Fargier, H., Prade, H.: Possibility Theory in Constraint Satisfaction Problems: Handling Priority, Preference and Uncertainty. Appl. Intell. 6 (1996) 287-309
10. Freuder, E.C., Wallace, R.J.: Partial Constraint Satisfaction. Artif. Intell. 58 (1992) 21-70
11. Frühwirth, T.: Constraint Handling Rules. In: Podelski, A. (Ed.): Constraint Programming: Basics and Trends (Châtillon-sur-Seine Spring School, France, May 1994). Lecture Notes in Computer Science, Vol. 910. Springer-Verlag, Berlin Heidelberg New York (1995)
12. Galinier, P., Hao, J.-K.: Tabu Search for Maximal Constraint Satisfaction Problems. In: Smolka, G. (Ed.): Proc. 3rd Int. Conf. on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, Vol. 1330. Springer-Verlag, Berlin Heidelberg New York (1997) 196-208
13. Georget, Y., Codognet, P.: Compiling Semiring-Based Constraints with clp (FD, S). In: Maher, M., Puget, J.-F. (Eds.): Principles and Practice of Constraint Programming (CP'98). Lecture Notes in Computer Science, Vol. 1520. Springer-Verlag, Berlin Heidelberg New York (1998) 205-219
14. Goltz, H.-J., Küchler, G., Matzke, D.: Constraint-Based Timetabling for Universities. In: Proc. INAP'98, 11th Int. Conf. on Applications of Prolog (1998) 75-80
15. Guéret, C., Jussien, N., Boizumault, P., Prins, C.: Building University Timetables Using Constraint Logic Programming. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 130-145
16. Henz, M., Würtz, J.: Using Oz for College Timetabling. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 162-177
17. e Constraint Library Manual, Release 5.5, 2002. http://www.icparc.ic.ac.uk/eclipse.
18. Jaffar, J., Maher, M.J.: Constraint Logic Programming: a Survey. J. Logic Program. 19 (1994) 503-581
19. Meseguer, P., Larrosa, J., Sánchez, M.: Lower Bounds for Non-binary Constraint Optimization Problems. In: Walsh, T. (Ed.): Principles and Practice of Constraint Programming (CP'01). Lecture Notes in Computer Science, Vol. 2239. Springer-Verlag, Berlin Heidelberg New York (2001) 317-331
20. Mooney, E.: Tabu Search Heuristics for Resource Scheduling. Ph.D. Thesis, Purdue University (1991)
21. Le Pape, C.: Implementation of Resource Constraints in ILOG SCHEDULE: a Library for the Development of Constraint-Based Scheduling Systems. Intell. Syst. Engng 3 (1994) 55-66
22. Robert, V., Hertz, A.: How to Decompose Constrained Course Scheduling Problems into Easier Assignment Type Subproblems. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 364-373
23. Rudová, H.: Constraint Satisfaction with Preferences. Ph.D. Thesis, Faculty of Informatics, Masaryk University (2001). http://www.fi.muni.cz/∼hanka/phd.html
24. Rudová, H.: Soft CLP(FD). In: Haller, S., Russell, I. (Eds.): Proc. 16th Int. Florida Artif. Intell. Symp. (FLAIRS'03). AAAI Press (2003) (Accepted for publication)
25. Rudová, H., Matyska, L.: Constraint-Based Timetabling with Student Schedules. In: Burke, E, Erben W. (Eds.): Practice and Theory of Automated Timetabling III (PATAT 2000, Konstanz, Germany, August, selected papers). Lecture Notes in Computer Science, Vol. 2079. Springer-Verlag, Berlin Heidelberg New York (2001) 109-123
26. Sampson, S.E., Freeland, J.R., Weiss, E.N.: Class Scheduling to Maximize Participant Satisfaction. Interfaces 25 (1995) 30-41
27. Schaerf, A.: A Survey of Automated Timetabling. Technical Report CS-R9567. CWI, Amsterdam (1995)
28. Van Hentenryck. P.: Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA (1989)
29. Veřmiřovský, K., Rudová, H.: Limited Assignment Number Search Algorithm. In: Student Res. Forum of the 29th Annu. Conf. on Curr. Trends in Theory and Practice of Informatics (SOFSEM'2002) (2002). See http://www.fi.muni.cz/∼hanka/publications