Solving the teacher assignment-course scheduling problem by a hybrid Algorithm

• Main Authors: GUNAWAN, Aldy, NG, Kien Ming, POH, Kim Leng
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2007
• Subjects: Timetabling problem; mathematical programming model; hybrid algorithm; simulated annealing; Programming Languages and Compilers; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/4001; https://ink.library.smu.edu.sg/context/sis_research/article/5003/viewcontent/Microsoft_Word___Ae_Hee_Park.doc.pdf
• Institution: Singapore Management University

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.