Graph coloring heuristics for solving examination timetabling problem at Universiti Utara Malaysia

Examination timetabling is a well-studied combinatorial optimization problem involving scheduling a set of examinations into a restricted number of time-slots while satisfying a defined set of constraints.This paper presents a real-world, capacitated examination timetabling problem from Universiti U...

Full description

Saved in:
Bibliographic Details
Main Authors: Abdul Rahman, Syariza, Sobri, Nur Suriani, Omar, Mohd Faizal, Benjamin, Aida Mauziah, Ramli, Razamin
Format: Conference or Workshop Item
Published: 2014
Subjects:
Online Access:http://repo.uum.edu.my/17407/
http://doi.org/10.1063/1.4903627
Tags: Add Tag
No Tags, Be the first to tag this record!