TY - JFULL
AU - Aldy Gunawan and Kien Ming Ng and Kim Leng Poh
PY - 2007/10/
TI - Solving the Teacher Assignment-Course Scheduling Problem by a Hybrid Algorithm
T2 - International Journal of Industrial and Manufacturing Engineering
SP - 490
EP - 496
VL - 1
SN - 1307-6892
UR - https://publications.waset.org/pdf/11119
PU - World Academy of Science, Engineering and Technology
NX - Open Science Index 9, 2007
N2 - This paper presents a hybrid algorithm for solving a timetabling problem, which is commonly encountered in many universities. The problem combines both teacher assignment and course scheduling problems simultaneously, and is presented as a mathematical programming model. However, this problem becomes intractable and it is unlikely that a proven optimal solution can be obtained by an integer programming approach, especially for large problem instances. A hybrid algorithm that combines an integer programming approach, a greedy heuristic and a modified simulated annealing algorithm collaboratively is proposed to solve the problem. Several randomly generated data sets of sizes comparable to that of an institution in Indonesia are solved using the proposed algorithm. Computational results indicate that the algorithm can overcome difficulties of large problem sizes encountered in previous related works.
ER -