Mushi, Allen2018-11-232018-11-232011-090976-5697http://hdl.handle.net/20.500.11810/5002Academic course timetabling involve assigning resources such as lecturers, rooms and courses to a fixed time period, normally a week, while satisfying a number of problem-specific constraints. This study describes a Great Deluge Algorithm in two phases that creates timetables by heuristically minimizing penalties over infeasibilities. The algorithm is developed with special focus on the University of Dar-as-salaam and compares the results with a previous work on Tabu Search, and a manually generated solution. We conclude that Great Deluge gives a much more stable solution because it produces good solutions with less number of parameters for tuning compared to Tabu Search.enCourse Timetabling, Great Deluge, Tabu SearchJournal Article