A hybrid algorithm for the examination timetabling problem

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

Volumn 2740, Issue , 2003, Pages 207-231

  Merlot, Liam T G ^a   Boland, Natashia ^a   Hughes, Barry D ^a   Stuckey, Peter J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION; SIMULATED ANNEALING;

COMBINATORIAL OPTIMIZATION PROBLEMS; CONSTRAINT PROGRAMMING; EXAMINATION TIMETABLING; HYBRID ALGORITHMS; HYBRID METHOD; INITIAL SOLUTION; QUALITY OF SOLUTION; UNIVERSITY OF MELBOURNE;

SCHEDULING;

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

References (21)

1. Boizumault, P., Delon, Y., Peridy, L.: Constraint Logic Programming for Examination Timetabling. J. Logic Program. 26 (1996) 217-233
2. Burke, E.K., Jackson, K., Kingston, J., Weare, R.F.: Automated University Timetabling: the State of the Art. Comput. J. 40 (1997) 565-571
3. Burke, E.K., Newall, J.: A Multistage Evolutionary Algorithm for the Timetable Problem. IEEE Trans. Evolut. Comput. 3 (1999) 63-74
4. Burke, E.K., Newall, J., Weare, R.F.: A Memetic Algorithm for University Exam 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) 241-250.
5. Burke, E.K., Newall, J., Weare, R.F.: Initialisation Strategies and Diversity in Evolutionary Timetabling. Evolut. Comput. J. (Special Issue on Scheduling) 6 (1998) 81-103
6. Burke, E.K., Newall, J., Weare, R.F.: A Simple Heuristically Guided Search for the Timetable Problem. Proc. Int. ICSC Symp. Eng. Intell. Syst. (1998) 574-579
7. Caramia, M., Dell'Olmo, P., Italiano, G.F.: New Algorithms for Examination Timetabling. In: Näher, S., Wagner, D. (Eds.): Algorithm Engineering 4th Int. Workshop, Proc. WAE 2000 (Saarbrücken, Germany, September) Lecture Notes in Computer Science, Vol. 1982. Springer-Verlag, Berlin Heidelberg New York (2001) 230-241
8. Carter, M., Laporte, G.: Recent Developments in Practical Examination 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) 373-383
9. Carter, M., Laporte, G., Chinneck, J.: A General Examination Scheduling System. Interfaces 24 (1994) 109-120
10. Carter, M., Laporte, G., Lee, S.T.: Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc. 47 (1996) 373-383
11. Dowsland, K.: Using Simulated Annealing for Efficient Allocation of Students to Practical Classes. In: Vidai, R.V.V. (Ed.): Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems, Vol. 396. Springer-Verlag, Berlin Heidelberg New York (1993) 125-150
12. Dowsland, K.: Off-the-Peg or Made-to-Measure? Timetabling and Scheduling with SA and TS. 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) 37-52
13. Di Gaspero, L., Schaerf, A.: Tabu Search Techniques for Examination Timetabling. 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) 104-117
14. Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge, MA (1999)
15. Schaerf, A.: Tabu Search Techniques for Large High-School Timetabling Problems. Proc. Natl Conf. Am. Assoc. Artif. Intell. AAAI Press, Menlo Park, CA (1996) 363-368
16. Thompson, J., Dowsland, K.: Ceneral Cooling Schedules for a Simulated Annealing Timetabling System. 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) 345-363
17. Thompson, J., Dowsland, K.: Variants of Simulated Annealing for the Examination Timetabling Problem. Ann. Oper. Res. 63 (1996) 105-128
18. Thompson, J., Dowsland, K.: A Robust Simulated Annealing Based Examination Timetabling System. Comput. Oper. Res. 25 (1998) 637-648
19. White, G.M., Xie, B.S.: Examination Timetables and Tabu Search with Longer-Term Memory. 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) 85-103
20. White, G.M., Zhang, J.: Generating Complete University Timetables by Combining Tabu Search with Constraint Logic. 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) 187-198.
21. Yoshikawa, M., Kaneko, K., Nomura, Y., Watanabe, M.: A Constraint-Based Approach to High-School Timetabling Problems: a Case Study. Proc. Natl Conf. Am. Assoc. Artif. Intell. AAAI Press, Menlo Park, CA (1994) 1111-1116