An Automated School Timetabling System Using Hybrid Intelligent Techniques

School timetabling is typically hard to resolve and the problem gets harder when teaching resources are scarce. The need for supporting stringent teaching requirements such as co-teaching and split-class teaching complicates the problem even more. In this paper, we describe an automated school timetabling system called @PT that reasons about sophisticated timetabling requirements. @PT makes use of a number of intelligent techniques including constraint technology, heuristics, local search operators, and tabu-list like data structure. It also changes its search behavior dynamically at run-time. Experimental results show that @PT is robust and manages to solve real problem instances effectively within minutes.

[1]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[2]  Peter J. Stuckey,et al.  A Hybrid Algorithm for the Examination Timetabling Problem , 2002, PATAT.

[3]  Masazumi Yoshikawa,et al.  A Constraint-Based Approach to High-School Timetabling Problems: A Case Study , 1994, AAAI.

[4]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling II , 1997, Lecture Notes in Computer Science.

[5]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling III , 2001, Lecture Notes in Computer Science.

[6]  Norman Sadeh,et al.  Look-ahead techniques for micro-opportunistic job shop scheduling , 1992 .

[7]  Masazumi Yoshikawa,et al.  Improving a Heuristic Repair Method for Large-Scale School Timetabling Problems , 1999, CP.

[8]  Philippe David.  A Constraint-Based Approach for Examination Timetabling Using Local Repair Techniques , 1997, PATAT.

[9]  Alvin C. M. Kwan,et al.  A Contention-Oriented Timeslot Selection Heuristic for School Timetabling , 2003 .

[10]  Gunther Schmidt,et al.  Timetable Construction - An Annotated Bibliography , 1980, Comput. J..

[11]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[12]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling IV , 2002, Lecture Notes in Computer Science.

[13]  Joxan Jaffar,et al.  Principles and Practice of Constraint Programming – CP’99 , 1999, Lecture Notes in Computer Science.

[14]  Calvin C. Gotlieb,et al.  The Construction of Class-Teacher Time-Tables , 1962, IFIP Congress.

[15]  Andrea Schaerf,et al.  Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems , 1997, IJCAI.

[16]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[17]  Wai-Yin Ng.  TESS: an interactive support system for school timetabling , 1997 .