Mushi, Allen R.Marwa, Y.2016-03-162016-03-162013Mushi, A.R. and Marwa, Y., 2013. Late Acceptance Heuristic for University Course Timetabling Problem. International Journal of Advanced Research in Computer Science, 4(2).0976-5697http://hdl.handle.net/123456789/1041Full text available at http://search.proquest.com/openview/83c3d0bb660d2f3330cc49bc0790d51e/1?pq-origsite=gscholarThis paper describes a Late Acceptance Heuristic for University Course Timetabling Problem, using a case study of a University College in Tanzania. Late Acceptance is one of relatively new heuristic procedures that try to improve searching by delaying acceptance of latest solutions. The results are compared with an implementation on Simulated Annealing heuristic, which is a well documented and successful heuristic procedure for similar problems. It is shown that Late Acceptance Procedure is a good procedure for Course timetabling problem and compares well with Simulated Annealing.enLate AcceptanceSimulated AnnealingCombinatorial OptimizationCourse TimetablingheuristicsJournal Article