Some Balanced Colouring Algorithms For Examination Timetabling | Zendy

Ghazali Sulong | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Some Balanced Colouring Algorithms For Examination Timetabling

Author(s) -

Ghazali Sulong

Publication year - 1992

Publication title -

jurnal teknologi

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.191

H-Index - 22

eISSN - 2180-3722

pISSN - 0127-9696

DOI - 10.11113/jt.v19.1057

Subject(s) - computer science , scheduling (production processes) , algorithm , graph , mathematics , mathematical optimization , theoretical computer science

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research