A constraint-based approach for examination timetabling using local repair techniques

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

Volumn 1408, Issue , 1998, Pages 169-186

  David, Philippe ^a  

^a ECOLE DES MINES DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; REPAIR; SCHEDULING;

1 MINUTES; COMPUTING TIME; CONSTRAINT-BASED; EXAMINATION TIMETABLING; LOCAL REPAIRS; SEARCH METHOD;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84957031400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055888     Document Type: Conference Paper

References (7)

1. Michael W. Carter. A survey of practical applications of examination timetabling algorithms. Operations Research, 34(2):193-202, 1986.
2. Michael W. Carter and Gilbert Laporte. Recent Developments in Practical Examination Timetabling. In Edmund Burke and Peter Ross, editors, Practice and Theory of Automated Timetabling, volume 1153 of Lectures Notes in Computer Science, pages 3-21. Springer-Verlag, 1996.
3. Alan K. Mackworth and Eugene C. Freuder. The complexity of constraint satisfaction revisited. Artificial Intelligence, 59:57-62, 1993.
4. Steven Minton, Mark D. Johnston, Andrew B. Philips, and Philip Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1-3):161-205, December 1992.
5. Bart Selman, Hector Levesque, and David Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-92), pages 440-446, San Jose, CA, 1992.
6. Edward Tsang. Foundations of constraint satisfaction. Academic Press, 1993.
7. M. Yoshikawa and K. Kaneko and T. Yamanouchi and M. Watanabe. A Constraint- Based High School Scheduling System. IEEE Expert, 11(1):63-72, February 1996.