Please use this identifier to cite or link to this item:
Title: Modeling and Heuristic Solutions of University Timetabling Problems
Keywords: course timetabling, examination timetabling, teacher assignment, course scheduling, hybrid algorithm, Quadratic Semi-Assignment Problem
Issue Date: 9-Jun-2009
Citation: ALDY GUNAWAN (2009-06-09). Modeling and Heuristic Solutions of University Timetabling Problems. ScholarBank@NUS Repository.
Abstract: This research mainly focuses on an important problem in the university timetabling problem, namely, the course timetabling problem. Most research works in this area only focus on one of the sub-problems of the course timetabling problem, such as the course scheduling problem where it is often assumed that the teacher assignment problem has already been solved earlier before the actual scheduling of courses to time periods. Motivated by the need to overcome this limitation of only considering one sub-problem, three different mathematical programming models that combine both teacher assignment and course scheduling problems simultaneously are introduced. Several algorithms based on hybridization of the Simulated Annealing and other methods are proposed to solve the resulting models.The idea of the hybrid algorithms is also applied to the examination timetabling problem, which is another important university timetabling problem that has been formulated as a Quadratic Semi-Assignment Problem in this thesis. A hybrid algorithm based on a combination of GRASP, Simulated Annealing and Tabu Search is introduced to solve the problem.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
GunawanA.pdf2.63 MBAdobe PDF



Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.