期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2017
卷号：95
期号：20
页码：5642
出版社：Journal of Theoretical and Applied
摘要：This research focuses on solving an examination timetabling problem by constructing solution using nonlinear heuristic modifier of Graph Coloring Heuristics. Two graph coloring heuristics i.e. largest degree and saturation degree were used within the nonlinear heuristic modifier to generate difficulty value of each examination, where it was modified nonlinearly whenever an examination cannot be scheduled in the previous iteration. Next, new ordering of examinations was obtained based on the new difficulty values and each examination was scheduled until a complete timetable is obtained. The nonlinear heuristic modifier is proposed to set a difficulty value of an examination within a nonlinear range, so that an effective estimation of examinations difficulty could be obtained. The Toronto benchmark datasets were used in the experiment where the aim is to obtain an examination schedule with minimum penalty value. It is found that the proposed method is comparable with other approaches, hence gives better examination ordering.
