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...
Saved in:
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!
|
Similar Items
-
A nonlinear heuristic modifier for constructing examination timetable
by: Abdul Rahman, Syariza, et al.
Published: (2017) -
Combination of Graph Heuristic with Hill Climbing Search for Solving Capacitated Examination Timetabling Problem
by: Ashis Kumar, Mandal, et al.
Published: (2015) -
The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
by: Lee Jian, Hao
Published: (2013) -
The graph heuristic with great deluge algorithm to solve the ITC2007 examination timetabling problem
by: Chuan, Wei Kiat
Published: (2014) -
Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem
by: Mandal, Ashis Kumar, et al.
Published: (2020)