Sharma, NanditaGedeon, Tamas (Tom)Mendis, B Sumudu2015-12-131872-4981http://hdl.handle.net/1885/74605The examination timetabling problem (ETP) is a NP complete, combinatorial optimization problem. Intuitively, use of properties such as patterns or clusters in the data suggests possible improvements in the performance and quality of timetabling. This papeKeywords: Australian National University; clusters; Combinatorial optimization problems; constraints; Data patterns; Examination timetabling; Statistical significance; Timetabling; Genetic algorithms; Population statistics; Scheduling clusters; constraints; data patterns; genetic algorithms; Timetabling201310.3233/IDT-1301572016-02-24