Some Balanced Colouring Algorithms For Examination Timetabling

Authors

  • Ghazali Sulong

DOI:

https://doi.org/10.11113/jt.v19.1057

Abstract

This paper describes some balanced colouring algorithms designed to construct examination schedules in such a way that :(1) all examination take place within a minimum number of days; (2) students are never scheduled to take two examinations at the same time; (3) the number of courses are scheduled into each period are approximately equal. These algorithms were tested on a large range of random graphs. Keywords: Balanced colouring,scheduling, random graphs,graph colouring

Downloads

Published

1992-05-15

Issue

Vol 19 (June 1992)

Section

Science and Engineering

License

Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.

How to Cite

Some Balanced Colouring Algorithms For Examination Timetabling. (1992). Jurnal Teknologi (Sciences & Engineering), 19(1), 57-63. https://doi.org/10.11113/jt.v19.1057