A multi-staged algorithmic process for the solution of the examination timetabling problem

7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008

Volumn , Issue , 2008, Pages

  Gogos, Christos ^a,b   Alefragis, Panayiotis ^a,c   Housos, Efthymios ^a  

^a UNIVERSITY OF PATRAS   (Greece)

^b Epirus Institute of Technology Arta   (Greece)

^c TECHNOLOGICAL EDUCATIONAL INSTITUTE OF PATRAS   (Greece)

Author keywords

GRASP; Integer programming; Kempe chains; Simulated annealing

Indexed keywords

HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; SIMULATED ANNEALING;

ALGORITHMIC PROCESS; EXAMINATION TIMETABLING; FEASIBLE SOLUTION; GRASP; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; META HEURISTICS; SOLUTION APPROACH; SOLUTION QUALITY;

SCHEDULING;

EID: 85007158546     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Asmuni H., Burke E., Garibaldi J. and McCollum B. (2005). Fuzzy multiple heuristic orderings for examination timetabling. PATAT 2005, LNCS 3616, pp 334-353. Springer-Verlag Berlin Heidelberg.
2. Burke E.K. and Newall J.P. (2004). Solving examination timetabling problems through adaptation of heuristic orderings. Annals of operations research 129, 107-134. Kluwer Academic Publishers, Netherlands.
3. Burke E.K. and Petrovic S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140, 266-280.
4. Carter M.W., Laporte G., Lee S.Y. (1996). Examination timetabling: Algorithmic strategies and applications. Journal of Operational Research Society, 47, 373-383.
5. Casey S. and Thompson J. (2003). GRASPing the Examination Scheduling Problem. PATAT 2002, LNCS 2740, pp. 232-244. Springer-Verlag Berlin Heidelberg.
6. Dowsland K.A. (1993). Simulated Annealing. Modern heuristic techniques for combinatorial problems by C. Reeves. John Wiley & Sons Inc. New York, USA. ISBN 0-470-22079-1.
7. Feo T.A. and Resende M.G.C. (1995) Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, 6, 109-133.
8. Glover F., Laguna M. (1997). Tabu Search. Kluwer Academic Publishers, Boston, MA.
9. Hansen P. and Mladenovic N. (2003). Chapter 6. Variable Neighborhood Search. Handbook of Metaheuristics by F. Glover and G. Kochenberger. Kluwer. ISBN: 978-1-4020-7263-5
10. McCollum B. (2007). A Perspective on Bridging the Gap Between Theory and Practice in University Timetabling. PATAT 2006, LNCS 3867, pp 3-23, ISBN 978-3-540-77344-3.
11. McCollum B. and McMullan M. (2007). The Second International Timetabling Competition: Examination Timetabling Track. Technical Report: QUB/IEEE/Tech/ITC2007/Exam/v4.0/17. September 20, 2007.
12. Qu R., Burke E., McCollum B. Merlot L. and Lee S. (2006). A Survey of Search Methodologies and Automated System Development for Examination Timetabling. Computer Science Technical Report No. NOTTCS-TR-2006-4.
13. Resende M.G.C. and Ribeiro C.C. (2003). Chapter 8. Greedy Randomized Adaptive Search Procedures. Handbook of Metaheuristics by F. Glover and G. Kochenberger. Kluwer. ISBN: 978-1-4020-7263-5.
14. Thompson J.M. and Dowsland K.A. (1996). Variants of Simulated Annealing for the Examination Timetabling Problem. Annals of Operations Research Volume 63, Number 1. Springer.