S. Abdullah, S. Ahmadi, E. K. Burke, and M. Dror, Investigating Ahuja-Orlins large neighbourhood search for examination timetabling, 2006.

R. K. Ahuja, J. B. Orlin, and D. Sharma, « Multi-exchange neighborhood search algorithm for capacitated minimum spanning tree problem, Mathematical Programming, pp.71-97, 2001.

J. S. Appleby, D. V. Blake, and E. A. Newman, « Techniques for Producing School Timetables on a Computer and their Application to other Scheduling Problems ». The Computer Journal 3, pp.237-245, 1961.

H. Asmuni, E. K. Burke, J. Garibaldi, and B. Mccollum, « Fuzzy multiple ordering criteria for examination timetabling, 2005.

P. Boizumault, Y. Delon, and L. Peridy, Constraint logic programming for examination timetabling, The Journal of Logic Programming, vol.26, issue.2, pp.217-233, 1996.
DOI : 10.1016/0743-1066(95)00100-X

D. «. Brelaz, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979.
DOI : 10.1145/359094.359101

S. «. Broder, Final examination scheduling, Communications of the ACM, vol.7, issue.8, pp.494-498, 1964.
DOI : 10.1145/355586.364824

E. K. Burke, A. J. Eckersley, B. Mccollum, S. Petrovic, and R. Qu, Hybrid variable neighbourhood approaches to university exam timetabling, European Journal of Operational Research, vol.206, issue.1, 2006.
DOI : 10.1016/j.ejor.2010.01.044

E. K. Burke, Y. Bykov, J. P. Newall, and S. Petrovic, A time-predefined local search approach to exam timetabling problems, IIE Transactions, vol.47, issue.6, pp.509-528, 2004.
DOI : 10.1002/spe.4380040306

E. K. Burke, Y. Bykov, and S. Petrovic, « A multicriteria approach to examination timetabling Practice and Theory of Automated Timetabling, papers from the 3rd International Conference. Springer Lecture Notes in Computer Science, pp.118-131, 2001.

E. K. Burke, M. Dror, S. Petrovic, and R. Qu, « Hybrid graph heuristics in hyperheuristics applied to exam timetabling problems The Next Wave in Computing, Optimization, and Decision Technologies, pp.79-91, 2005.

E. K. Burke and J. P. Newall, A multistage evolutionary algorithm for the timetable problem, IEEE Transactions on Evolutionary Computation, vol.3, issue.1, pp.63-74, 1999.
DOI : 10.1109/4235.752921

E. K. Burke and J. P. Newall, « Enhancing timetable solutions with local search methods Practice and Theory of Automated Timetabling: Selected Papers from the 4th International Conference, Lecture Notes in Computer Science, pp.2740-195, 2003.

E. K. Burke and J. P. Newall, Solving Examination Timetabling Problems through Adaption of Heuristic Orderings, Annals of Operations Research, vol.129, issue.1-4, pp.107-134, 2004.
DOI : 10.1023/B:ANOR.0000030684.30824.08

E. K. Burke, J. P. Newall, and R. F. Weare, A memetic algorithm for university exam timetabling, Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference. Springer Lecture Notes in Computer Science, pp.241-250, 1996.
DOI : 10.1007/3-540-61794-9_63

M. Caramia, P. Dellolmo, and G. F. Italiano, New Algorithms for Examination Timetabling, Algorithm Engineering 4th International Workshop, Proceedings WAE 2000. Springer Lecture Notes in Computer Science, pp.230-241, 1982.
DOI : 10.1007/3-540-44691-5_20

M. W. Carter, J. W. Chinneck, and G. Laporte, «A general examination scheduling system». Interfaces, pp.109-120, 1994.

M. W. Carter and D. G. Johnson, Extended clique initialisation in examination timetabling, Journal of the Operational Research Society, vol.52, issue.5, pp.538-544, 2001.
DOI : 10.1057/palgrave.jors.2601115

M. W. Carter, G. Laporte, and S. Y. Lee, Examination Timetabling: Algorithmic Strategies and Applications, Journal of the Operational Research Society, vol.47, issue.3, pp.373-383, 1996.
DOI : 10.1057/jors.1996.37

A. Colorni, M. Dorigo, V. F. Maniezzo, P. Varela, and . Bourgine, « Distributed optimization by ant colonies, Proc. Europ. Conf. Artificial life, 1991.

D. Costa and A. Hertz, Ants can colour graphs, Journal of the Operational Research Society, vol.48, issue.3, pp.295-305, 1997.
DOI : 10.1057/palgrave.jors.2600357

P. «. David, A constraint-based approach for examination timetabling using local repair techniques Practice and Theory of Automated Timetabling, Selected Papers from the 2nd International Conference. Springer Lecture Notes in Computer Science, pp.169-186, 1408.

D. Gaspero and L. Recolour, shake and kick: A recipe for the examination timetabling problem, 2002.

D. Gaspero, L. Schaerf, and A. «. , Tabu Search Techniques for Examination Timetabling, Practice and Theory of Automated Timetabling: Selected Papers from the 3rd International Conference, pp.104-117, 2001.
DOI : 10.1007/3-540-44629-X_7

M. Dorigo, « Optimization, learning and natural algorithms ». Doctoral dissertation, 1992.

M. Dorigo, V. Maniezzo, and A. Colorni, « Ant system : optimization by a colony of cooperating agents ». IEEE transaction on systems, Man and Cybernetics, pp.29-41, 1996.

M. Dorigo and T. Stützle, The ant colony optimisation metaheuristic: Algorithms, applications and advances, Handbook of Metaheuristics of International Series in Operations Research and Management Science, pp.251-285, 2002.

K. A. Dowsland and J. Thompson, Ant colony optimization for the examination scheduling problem, Journal of the Operational Research Society, vol.63, issue.4, pp.426-438, 2005.
DOI : 10.1007/978-1-4615-5775-3_22

G. «. Dueck, New Optimization Heuristics, Journal of Computational Physics, vol.104, issue.1, pp.86-92, 1993.
DOI : 10.1006/jcph.1993.1010

T. A. Duong and K. H. Lam, « Combining constraint programming and simulated annealing on university exam timetabling, Proceedings of the 2nd International Conference in Computer Sciences, Research, Innovation & Vision for the Future, pp.205-210, 2004.

W. «. Erben, A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling, Practice and Theory of Automated Timetabling: Selected Papers from the 3rd International Conference, pp.132-156, 2001.
DOI : 10.1007/3-540-44629-X_9

T. A. Feo and M. G. Resende, Greedy Randomized Adaptive Search Procedures, Journal of Global Optimization, vol.68, issue.2, pp.109-133, 1995.
DOI : 10.1007/BF01096763

M. Garey and D. Johnson, Computers and intractability a guide to the theory of, 1977.

D. Ghosh and G. Sierksma, « Complete local search with memory », Journal of Heuristics, vol.8, issue.6, pp.571-84, 2002.
DOI : 10.1023/A:1020307925279

P. V. Hentenryck, « The OPL Optimization Programming Language, 1999.

N. M. Hussin and G. Kendall, « A tabu search hyper-heuristic approach to the examination timetabling problem at the MARA university of technology Selected Papers from the 5th International R, Abounacer, J. Boukachour, B. Dkhissi and A. El Hilali Alaoui Revue ARIMA, vol.12, pp.15-42, 2005.

L. T. Merlot, N. Boland, B. D. Hughes, and P. J. Stuckey, A Hybrid Algorithm for the Examination Timetabling Problem
DOI : 10.1007/978-3-540-45157-0_14

N. Azimi and Z. «. , Comparison of metaheuristic algorithms for Examination Timetabling Problem, Journal of Applied Mathematics and Computing, vol.104, issue.7/8, pp.337-354, 2004.
DOI : 10.1007/BF02936173

L. Paquete and T. Stutzle, « Empirical analysis of tabu search for the lexicographic optimization of the examination timetabling problem, Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling. 21st-23rd, pp.413-420, 2002.

S. Petrovic and Y. Bykov, A Multiobjective Optimisation Technique for Exam Timetabling Based on Trajectories
DOI : 10.1007/978-3-540-45157-0_12

S. Petrovic and Y. Yang, « A Novel similarity measure for heuristic selection in examination timetabling, Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling. Springer Lecture Notes in Computer Science, pp.377-396, 2004.

R. Qu, E. K. Burke, B. Mccollum, L. T. Merlot, and S. Y. Lee, « A Survey of Search Methodologies and Automated Approaches for Examination Timetabling, Computer Science Technical Report, 2006.

P. Ross, J. G. Marin-blazquez, and E. Hart, Hyper-heuristics applied to class and exam timetabling problems, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), pp.1691-1698, 2004.
DOI : 10.1109/CEC.2004.1331099

K. «. Sheibani, An evolutionary approach for the examination timetabling problems, Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling. 21st-23rd, pp.387-396, 2002.

H. Terashima-marin, P. Ross, and M. Valenzuela-rendon, « Evolution of constraint satisfaction strategies in examination timetabling, Proceedings of the Genetic and Evolutionary Conference, pp.635-642, 1999.

H. Terashima-marin, P. Ross, and M. Valenzuela-rendon, Clique-based crossover for solving the timetabling problem with GAs, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
DOI : 10.1109/CEC.1999.782572

J. Thompson and K. Dowsland, A robust simulated annealing based examination timetabling system, Computers & Operations Research, vol.25, issue.7-8, pp.637-648, 1998.
DOI : 10.1016/S0305-0548(97)00101-9

G. M. White and B. S. Xie, Examination Timetables and Tabu Search with Longer-Term Memory, Practice and Theory of Automated Timetabling: Selected Papers from the 3rd International Conference. Springer Lecture Notes in Computer Science, pp.85-103, 2001.
DOI : 10.1007/3-540-44629-X_6

G. M. White, B. S. Xie, and Z. S. , Using tabu search with longer-term memory and relaxation to create examination timetables, European Journal of Operational Research, vol.153, issue.1, pp.80-91, 2004.
DOI : 10.1016/S0377-2217(03)00100-0

D. C. Wood, A system for computing university examination timetables, The Computer Journal, vol.11, issue.1, pp.41-47, 1968.
DOI : 10.1093/comjnl/11.1.41

M. Zeleny, A concept of compromise solutions and the method of the displaced ideal, Computers & Operations Research, vol.1, issue.3-4, pp.479-496, 1974.
DOI : 10.1016/0305-0548(74)90064-1