Scheduling involves determining the start and the end time of resource assignments, events, or tasks to achieve a particular goal. A good schedule can increase the efficiency and the utilization of resources. The University Examination Timetabling Problem (UETP) is an NP-hard problem that determines the schedule of exams given students’ exam lists and limited period and room. This study proposes using a Great Deluge Algorithm (GD) with local search operators to solve the UETP. The method is used to generate solutions for the uncapacitated Toronto benchmark datasets. The proposed method shows promising results compared to the original Great Deluge Algorithm and the Modified Great Deluge Algorithm available in previous literature.