Teoh, Chong Keat and Ngadiman, Salihin and Wibowo, Antoni (2015) A rectification strategy in genetic algorithms for academic timetabling problem. Jurnal Teknologi, 74 (1). pp. 159-163. ISSN 0127-9696
|
PDF (Full Text)
783kB |
Official URL: http://dx.doi.org/10.11113/jt.v74.3041
Abstract
The university course timetabling problem is both an NP-hard and NP-complete scheduling problem. The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institution and may take on the form of high school timetabling, examination timetabling or university course timetabling. In this paper, the authors attempt to construct a feasible timetable for a faculty department in a local university in Malaysia which at the present moment; the scheduling task is performed manually by an academic registrar. The feasible timetable is constructed by means of Genetic Algorithm, embedded with a rectification strategy which transforms infeasible timetables into feasible timetables.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | academic timetabling problem, genetic algorithm |
Subjects: | T Technology > T Technology (General) > T58.5-58.64 Information technology |
Divisions: | Computing |
ID Code: | 55860 |
Deposited By: | Practical Student |
Deposited On: | 12 Oct 2016 06:36 |
Last Modified: | 01 Nov 2017 04:17 |
Repository Staff Only: item control page