Publication Type
Journal Article
Version
publishedVersion
Publication Date
1-2007
Abstract
This paper formulates a timetabling problem, which is often encountered in a university, as a mathematical programming model. The proposed model combines both teacher assignment and course scheduling problems simultaneously, which causes the entire model to become more complex. We propose an improvement heuristic algorithm to solve such a model. The proposed algorithm has been tested with several randomly generated datasets of sizes that are comparable to those occurring in a university in Indonesia. The computational results show that the improvement heuristic is not only able to obtain good solutions, but is also able to do so within reasonable computational time.
Keywords
timetabling, mathematical programming, improvement heuristic algorithm
Discipline
Programming Languages and Compilers | Theory and Algorithms
Research Areas
Intelligent Systems and Optimization
Publication
International Journal Computational Science
Volume
1
Issue
2
First Page
162
Last Page
178
Citation
GUNAWAN, Aldy; NG, Kien Ming; and POH, Kim Leng.
An improvement heuristic for the timetabling problem. (2007). International Journal Computational Science. 1, (2), 162-178.
Available at: https://ink.library.smu.edu.sg/sis_research/4002
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.