Interactively solving school timetabling problems using extensions of constraint programming

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

Volumn 3616 LNCS, Issue , 2005, Pages 190-207

  Cambazard, Hadrien ^a   Demazeau, Fabien ^b   Jussien, Narendra ^a   David, Philippe ^a  

^a ECOLE DES MINES DE NANTES   (France)

^b ISoft   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTATION THEORY; CONSTRAINT THEORY;

CONSTRAINT PROGRAMMING; TIMETABLING PROBLEMS;

PROBLEM SOLVING;

EID: 33645988169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593577_12     Document Type: Conference Paper

References (23)

1. Barták, R., Müller, T., Rudová, H.: A New Approach to Modeling and Solving Minimal Perturbation Problems. In: Apt, K. R., Fages, F., Rossi, F., Szeredi, P., Vancza, J. (eds.) Recent Advances in Constraints. Lecture Notes in Computer Science, Vol. 2809. Springer, Berlin (2004) 233-249
2. Berlandier, P., Neveu, B.: Arc-Consistency for Dynamic Constraint Problems: A RMS Free Approach. In: Proc. ECAF94 Workshop on Constraint Satisfaction Issues raised by Practical Applications (1994)
3. Bessière., C.: Arc Consistency in Dynamic Constraint Satisfaction Problems. In: Nat. Conf. on Artificial Intelligence - AAAI'91 (1991)
4. de Backer, B., Béringer, H.: Intelligent Backtracking for CLP Languages: An Application to CLP(R). In: Saraswat, V., Ueda, K. (eds.) ILPS'91: Proc. Int. Logic Programming Symposium (San Diego, CA). MIT Press, Cambridge, MA (1991) 405-419
5. Cheng, E., Kruk, S., Lipman, M.: Flow Formulation for the Student Scheduling Problem. In: Burke, E. K., De Causmaecker, P. (eds.) Practice and Theory of Automated Timetabling IV. Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin (2003) 299-309
6. Debruyne, R.: Arc-Consistency in Dynamic CSPs is No More Prohibitive. In: 8th Conf. on Tools with Artificial Intelligence (TAI'96) (1996) 299-306
7. Debruyne; R., Ferrand, G., Jussien, N., Lesaint, W., Ouis, S., Tessier, A.: Correctness of Constraint Retraction Algorithms. In: FLAIRS'03: 16th Int. Florida Artificial Intelligence Research Society Conf. (St Augustine, FL). AAAI Press, Menlo Park, CA (2003) 172-176
8. Elkhyari, A.: Outils d'Aide à la Décision Pour les Problèmes d'Ordonnancement Dynamique. Ph.D. Thesis. École des Mines de Nantes, France (2003) in French
9. Elkhyari, A., Guéret, C., Jussien, N.: Solving Dynamic Timetabling Problems as Dynamic Resource Constrained Project Scheduling Problems Using New Constraint Programming Tools. In: Burke, E. K., De Causmaecker, P. (eds.) Practice and Theory of Automated Timetabling IV. Lecture Notes in Computer Science, Vol. 2740. Springer, Berlin (2003) 39-59
10. Elkhyari, A., Guéret, C., Jussien, N.: Constraint Programming for Dynamic Scheduling Problems. In: Hiroshi Kise, H. (ed.) ISS'04 Int. Scheduling Symp. (Awaji, Hyogo, Japan). Japan Society of Mechanical Engineers (2004) 84-89
11. Elkhyari, A., Guéret, C., Jussien, N.: Stable Solutions for Dynamic Project Scheduling Problems. In: PMS'04 Int. Workshop on Project Management and Scheduling (Nancy, France, April 2004) 380-384
12. Georget, Y., Codognet, P., Rossi, F.: Constraint Retraction in CLP(FD): Formal Framework and Performance Results. Constraints 4 (1999) 5-42
13. Hertz, A.: Tabu Search for Large Scale Timetabling Problems. Eur. J. Oper. Res. 54 (1991) 39-47
14. Jussien, N.: E-Constraints: Explanation-Based Constraint Programming. In: CP01 Workshop on User-Interaction in Constraint Satisfaction (Paphos, Cyprus, December, 2001)
15. Jussien, N., Boizumault, P.: Best-First Search for Property Maintenance in Reactive Constraints Systems. In: Int. Logic Programming Symp. (Port Jefferson, NY). MIT Press, Cambridge, MA (1997) 339-353
16. Jussien, N., Lhomme, O.: Local Search with Constraint Propagation and Conflict-Based Heuristics. Artif. Intell. 139 (2002) 21-45
17. Jussien, N., Ouis, S.: User-Friendly Explanations for Constraint Programming. In: ICLP'01 11th Workshop on Logic Programming Environments (WLPE'01, Paphos, Cyprus, December, 2001)
18. Müller, T., Rudová, H.: Minimal Perturbation Problem in Course Timetabling. In: Proceedings of the 4th International Conference on the Practice And Theory of Automated Timetabling (PATAT'04, Pittsburgh, PA) 283-303
19. Régin, J.-C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: AAAI 94, 12th Nat. Conf. on Artificial Intelligence (Seattle, WA) 362-367
20. Régin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraint. AAAI/IAAI (1996) 209-215
21. Rochart, G., Jussien, N., Laburthe, F.: Challenging Explanations for Global Constraints. In: CP03 Workshop on User-Interaction in Constraint Satisfaction (UICS'03, Kinsale, Ireland, September) 31-43
22. Santiago-Mozos, R., Salcedo-Sanz, S., DePrado-Cumplido, M., Bousoño-Calzón, C.: A Two-Phase Heuristic Evolutionary Algorithm for Personalizing Course Timetables: A Case Study in a Spanish University. Comput. Oper. Res. 32 (2005) 1761-1776
23. Wilson, M., Borning, A.: Hierarchical Constraint Logic Programming. J. Logic Program. 16 (1993) 277-318