A nonlinear heuristic modifier for constructing examination timetable
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 difficul...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
JATIT
2017
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/26045/1/JTAIT%2095%2020%202017%205142%205653.pdf |