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...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2014
|
| Subjects: |