Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/54214
Title: A genetic algorithm for the teacher assignment problem for a University in Indonesia
Authors: Gunawan, A.
Ng, K.M. 
Ong, H.L. 
Keywords: Genetic algorithm
Metaheuristics
Teacher assignment problem
Timetabling problem
Issue Date: Mar-2008
Source: Gunawan, A.,Ng, K.M.,Ong, H.L. (2008-03). A genetic algorithm for the teacher assignment problem for a University in Indonesia. International Journal of Information and Management Sciences 19 (1) : 1-16. ScholarBank@NUS Repository.
Abstract: In this paper, we address a timetabling problem arising from an institution in Indonesia. The problem addressed is the assignment of teachers to the courses and course sections at the university level. This teacher assignment problem is first formulated as a mathematical programming model and a genetic algorithm with two types of crossover is then proposed for solving the problem. The proposed algorithm consists of two phases. The first phase focuses on allocating the teachers to the courses and determining the number of courses to be assigned to each teacher. From the results obtained in the first phase, the second phase will then involve scheduling the teachers to the course sections in order to balance the teachers' load. The performance of the proposed algorithm is evaluated against two real data sets taken from an institution in Indonesia and some randomly generated problem instances. For the real data sets, the computational results show that the proposed algorithm yields better solutions when compared to manual allocation done by the institution.
Source Title: International Journal of Information and Management Sciences
URI: http://scholarbank.nus.edu.sg/handle/10635/54214
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)

64
checked on Dec 14, 2017

Google ScholarTM

Check


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