Publication Type
Journal Article
Version
publishedVersion
Publication Date
1-2007
Abstract
This paper presents a hybrid algorithm for solving atimetabling problem, which is commonly encountered in manyuniversities. The problem combines both teacher assignment andcourse scheduling problems simultaneously, and is presented as amathematical programming model. However, this problem becomesintractable and it is unlikely that a proven optimal solution can beobtained by an integer programming approach, especially for largeproblem instances. A hybrid algorithm that combines an integerprogramming approach, a greedy heuristic and a modified simulatedannealing algorithm collaboratively is proposed to solve the problem.Several randomly generated data sets of sizes comparable to that ofan institution in Indonesia are solved using the proposed algorithm.Computational results indicate that the algorithm can overcomedifficulties of large problem sizes encountered in previous relatedworks.
Keywords
Timetabling problem, mathematical programming model, hybrid algorithm, simulated annealing
Discipline
Programming Languages and Compilers | Theory and Algorithms
Research Areas
Intelligent Systems and Optimization
Publication
International Journal of Computer, Information, and Systems Science, and Engineering
Volume
1
Issue
2
First Page
136
Last Page
141
ISSN
1307-2331
Publisher
World Academy of Science, Engineering and Technology (WASET)
Citation
GUNAWAN, Aldy; NG, Kien Ming; and POH, Kim Leng.
Solving the teacher assignment-course scheduling problem by a hybrid Algorithm. (2007). International Journal of Computer, Information, and Systems Science, and Engineering. 1, (2), 136-141.
Available at: https://ink.library.smu.edu.sg/sis_research/4001
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.