An automated school timetabling system using hybrid intelligent techniques

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

Volumn 2871, Issue , 2003, Pages 124-134

  Kwan, Alvin C M ^a   Chung, Ken C K ^b   Yip, Kammy K K ^b   Tam, Vincent ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b Real Logic Technology   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT SYSTEMS; TABU SEARCH; DATA STRUCTURES; HEURISTIC METHODS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); TEACHING;

CONSTRAINT TECHNOLOGY; INTELLIGENT TECHNIQUES; LOCAL SEARCH OPERATORS; REAL PROBLEMS; SCHOOL TIMETABLING; SEARCH BEHAVIOR; TEACHING RESOURCES; TIMETABLING;

SCHEDULING; ARTIFICIAL INTELLIGENCE;

CO-TEACHING; SPLIT-CLASS TEACHING; TEACHING RESOURCES; TIMETABLING SYSTEMS;

EID: 0142214559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39592-8_18     Document Type: Conference Paper

References (16)

1. Burke, E. & Erben, W. (Eds.) 2001. Practice and Theory of Automated Timetabling III. Lecture Notes in Computer Science 2079, Springer.
2. David, P. 1997. A constraint-based approach for examination timetabling using local repair techniques. In: Burke, E., Ross, P. (Eds.), Practice and Theory of Automated Timetabling II, Lecture Notes in Computer Science, vol. 1408. Springer, 169–186.
3. Gotlieb, C.C. 1963. The construction of class-teacher time-tables. In Popplewell C.M. (ed.): Proceedings of IFIP Congress 62, Amsterdam, North-Holland, 73–77.
4. Haralick, R.M. & Elliott, G.L. 1980. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14: 263–313.
5. Kaneko, K., Yoshikawa, M. & Nakakuki, Y. 1999. Improving a heuristic repair method for large-scale school timetabling problems. In Joxan Jaffar (Ed.): Proceedings of the 5th International Conference Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 1713, Springer, 275–288.
6. Kwan, A.C.M. & Chung, K.C.K. 2002. A contention-oriented timeslot selection heuristic for school timetabling. In Bramer, M., Preece, A. & Coenen, F. (Eds.): Proceedings of the 22nd SGAI International Conference on Knowledge Based Systems and Applied Artificial Intelligence, Springer, 381–394.
7. Kwan, A.C.M., Chung, K.C.K. & Yip K. K. K. 2002. Data Modeling for School Timetabling - A Case Study. In Torrellas, G.A.S. & Uskov, V. (Eds.): Proceedings of the 5th IASTED International Multi-Conference on Computers and Advanced Technology in Education, ACTA Press, 211–215.
8. Kwan, A.C.M. & Chan, H.L. 1999. Efficient lesson selection heuristic for high school timetabling. In Hamza, M.H. (Ed.): Proceedings of the IASTED International Conference Artificial Intelligence and Soft Computing, ACTA Press, 323–327.
9. Merlot, L., Boland, N., Hughes, B. & Stuckey P.J. 2003. A hybrid algorithm for the examination timetabling problem. In: Proceedings of PATAT2002, LNCS, page to appear. Springer.
10. Minton, S., Johnston, M.D., Philips, A.B. & Laird, P. 1992. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58: 161–205.
11. Ng, W-Y. 1997. TESS: an interactive support system for school timetabling. In Fung, A.C.W. (Ed.): Information Technology in Education Management for the Schools of the Future, Chapman and Hall, 131–137.
12. Sadeh, N. 1991. Lookahead techniques for micro-opportunistic job-shop scheduling. PhD thesis, Carnegie-Mellon University. CMU-CS-91-102.
13. Schaerf, A. 1997. Combining local search and look-ahead for scheduling and constraint satisfaction problems. In: Proceedings of the International Joint Conference on Artificial Intelligence, 1254–1259.
14. Schaerf, A. 1999. A survey of automated timetabling. Artificial Intelligence Review, 13 (2): 87–127.
15. Schmidt, G. & Strohlein, T. 1979. Timetabling construction – an annotated bibliography. The Computer Journal, 23(4): 307–316.
16. Yoshikawa, M., Kaneko, K., Nomura, Y. & Watanabe, M. 1994. A constraint-based approach to high-school timetabling problems: a case study. In: Proceedings of the 12th National Conference on Artificial Intelligence, 1111–1116.