Please use this identifier to cite or link to this item:
Title: Solving the teacher assignment problem by two metaheuristics
Authors: Gunawan, A.
Ng, K.M. 
Keywords: Simulated annealing
Tabu search
Teacher assignment
Timetabling problem
Issue Date: Mar-2011
Citation: Gunawan, A.,Ng, K.M. (2011-03). Solving the teacher assignment problem by two metaheuristics. International Journal of Information and Management Sciences 22 (1) : 73-86. ScholarBank@NUS Repository.
Abstract: The timetabling problem arising from a university in Indonesia is addressed in this paper. It involves the assignment of teachers to the courses and course sections. We formulate the problem as a mathematical programming model. Two different algorithms, mainly based on simulated annealing (SA) and tabu search (TS) algorithms, are proposed for solving the problem. The proposed algorithms consist of two phases. The first phase involves allocating the teachers to the courses and determining the number of courses to be assigned to each teacher. The second phase involves assigning the teachers to the course sections in order to balance the teachers' load. The performance of the proposed algorithms is evaluated using two sets of real data and some randomly generated problem instances. The computational results show that in general, tabu search performs better than simulated annealing and other previous work. For the real data sets, the computational results show that both proposed algorithms yield better solutions when compared to manual allocation done by the university.
Source Title: International Journal of Information and Management Sciences
ISSN: 10171819
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Mar 29, 2020

Google ScholarTM


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