A time-predefined approach to course timetabling

Yugoslav Journal of Operations Research

Volumn 13, Issue 2, 2003, Pages 139-151

  Burke, Edmund ^a   Bykov, Yuri ^a   Newall, James ^b   Petrovic, Sanja ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b eventMAP Ltd   (United Kingdom)

Author keywords

Combinatorial optimisation; Local search; Metaheuristic; Timetabling

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; SIMULATED ANNEALING;

COMBINATORIAL OPTIMIZATION; LOCAL SEARCH; METAHEURISTICS; TIMETABLING;

OPERATIONS RESEARCH;

EID: 24744453252     PISSN: 03540243     EISSN: None     Source Type: Journal    
DOI: 10.2298/YJOR0302139B     Document Type: Article

References (27)

1. Aarts, E., and Lenstra, J.K., Local Search in Combinatorial Optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Chichester, 1997.
2. Abramson, D., "Constructing school timetables using simulated annealing: Sequential and parallel algorithms", Management Science, 37(1) (1991) 98-113.
3. Abramson, D., Krishnamoorthy, M., and Dang, H., "Simulated annealing cooling schedules for the school timetabling problem", Asia-Pacific J. of Operational Research, 16 (1999) 1-22.
4. Appleby, J.S., Blake, D.V., and Newman, E.A., "Techniques for producing school timetables on a computer and their application to other scheduling problems", The Computer Journal, 3 (1960) 237-245.
5. Burke, E.K., and Petrovic, S., "Recent research directions in automated timetabling", European Journal of Operational Research, 140 (2) (2002) 266-280.
6. Burke, E.K., Bykov, Y., Newall, J., and Petrovic, S., "A time pre-defined local search approach to exam timetabling problems", accepted for publication in IIE Transaction on Operations Engineering (2004).
7. Carter, M.W., and Laporte, G., "Recent developments in practical examination timetabling", in: E. Burke, M. Carter (eds.), The Practice and Theory of Automated Timetabling II: Selected Papers (PATAT97). Lecture Notes in Computer Science, Vol. 1408, Springer-Verlag, Berlin, Heidelberg, New York, 1998, 3-19.
8. Cheng, C., Kang, L., Leung, N., and White G.M., "Investigations of a constraint logic programming approach to university tametabling", in: E. Burke, P. Ross (eds.), The Practice and Theory of Automated Timetabling: Selected Papers (ICPTAT95). Lecture Notes in Computer Science, Vol. 1153, Springer-Verlag, Berlin, Heidelberg, New York, 1996, 112-129.
9. Colorni, A., Dorgio, M., and Maniezzo, V., "Genetic algorithms and highly constrained problems: The time-table case", in: G. Goos, J. Hartmanis (eds.), Parallel Problem Solving from Nature, Springer-Verlag, 1990, 55-59.
10. Cooper, T.B., and Kingston, J.H., "The solution of real instances of the timetabling problem", The Computer Journal, 36 (7) (1993) 645-653.
11. Davis, L., and Rutter, L., "Schedule optimization with probabilistic search", Proceedings of the 3rd IEEE Conference on Artificial Intelligence Applications (Orlando, Florida, USA, Feb. 1987), IEEE1987, 1987, 231-236.
12. Dowsland, K., "Simulated Annealing", in: C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, 1993, 20-69.
13. Dueck, G., and Scheuer, T., "Threshold accepting: A general purpose optimization algorithm appearing superior to Simulated Annealing", Journal of Computational Physics, 90 (1990) 161-175.
14. Dueck, G., "New optimization heuristics. The Great Deluge algorithm and the record-to-record travel", Journal of Computational Physics, 104 (1993) 86-92.
15. Elmohamed, M.A.S., Coddington, P., and Fox, G., "A Comparison of annealing techniques for academic course scheduling", in: E. Burke, M. Carter (eds.), The Practice and Theory of Automated Timetabling: Selected Papers (PATAT '97). Lecture Notes in Computer Science, Vol. 1408, Springer-Verlag, Berlin Heidelberg, New York, 1998, 92-112.
16. Gueret, G., Jussien, N., Boizumault, P., and Prins, C., "Building university timetables using constraint logic programming", in: E. Burke, P. Ross (eds.): The Practice and Theory of Automated Timetabling: Selected Papers (ICPTAT '95). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg, New York, 1996, 130-145.
17. Hertz, A., "Tabu search for large scale timetabling problems", European Journal of Operational Research, 54 (1991) 39-47.
18. Hu, T.C., Kahng, A.B., and Tsao, C.W., "Old bachelor acceptance: A new class of nonmonotone threshold accepting methods", ORSA Journal on Computing, 7(4) (1995) 417-425.
19. Kirkpatrick, S., Gellat, J.C.D., and Vecci, M.P., "Optimization by simulated annealing", Science, 220 (1983) 671-680.
20. Koulmas, C., Antony, S.R., and Jaen, R., "A survey of simulated annealing applications to operations research problems", Omega International Journal of Management Science, 22 (1994) 41-56.
21. Laporte, G., and Desroches, S., "The problem of assigning students to course sections in a large engineering school", Computers and Operations Research, 13 (4) (1986) 387-394.
22. Melicio, F., Caldeira, P., and Rosa, A., "Solving the timetabling problem with simulated annealing", Proceedings of the First International Conference on Enterprise Information Systems (ICEIS'99), 1999, 272-279.
23. Paechter, B., Cumming, A., Norman, M.G., and Lucian, H., "Extensions to a memetic timetabling system", in: E. Burke, P. Ross (eds.), The Practice and Theory of Automated Timetabling: Selected Papers (ICPTAT '95). Lecture Notes in Computer Science, Vol. 1153, Springer-Verlag, Berlin Heidelberg, New York, 1996, 251-265.
24. Schaerf, A., "Tabu search techniques for large high-school timetabling problems", Proceedings of the 13th American Conference on Artificial Intelligence (AAAI-96), Portland, Oregon, USA August 1996, 363-368.
25. Schaerf A., "A survey of automated timetabling", Artificial Intelligent Review, 13 (1999) 87-127.
26. Ueda, H., Ouchi, D., Takahashi, K., and Miyahara, T., "A co-evolving timeslot/room assignment genetic algorithm technique for university timetabling", in: E. Burke, W. Erben (eds.), The Practice and Theory of Automated Timetabling III: Selected Papers (PATAT 2000). Lecture Notes in Computer Science, Vol. 2079, Springer-Verlag, Berlin, Heidelberg, New York, 2001, 48-63.
27. International Timetabling Competition home page: http://www.idsia.ch/Files/ttcomp2002/