Teoh, Chong Keat and Wibowo, Antoni and Ngadiman, Salihin (2015) A rectification strategy in genetic algorithms for academic timetabling problem. Jurnal Teknologi, 74 (1). pp. 153-157. ISSN 0127-9696

Preview

PDF Download (780kB) | Preview

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; rectification strategy
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Divisions:	School of Computing
Depositing User:	Dr. Antoni Wibowo
Date Deposited:	22 Aug 2016 08:54
Last Modified:	22 Aug 2016 08:54
URI:	https://repo.uum.edu.my/id/eprint/18614

Actions (login required)

View Item