| Autor: |
Ojonukpe Sylvester Egwuche |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
2020 International Conference in Mathematics, Computer Engineering and Computer Science (ICMCECS). |
| DOI: |
10.1109/icmcecs47690.2020.246988 |
| Popis: |
Graph coloring is the task of assigning colors or labels to elements of a graph (edges or vertices) subject to some constraints. Time table scheduling requires efficient allocation of resources in a way that no conflict arises. Lectures and examination timetabling can easily result to conflicts if not adequately planned. These conflicts range from clashes in examination venues to some departments not assigned venues. The study presents resource scheduling algorithms using graph coloring for a flexible timetabling system that is applicable in educational institutions. The objective is to assign schedules to courses during examination. The system was tested on data collected from two departments at Federal Polytechnic, Ile-oluji. Soft and hard constraints were considered and effective allocation of the resources was achieved without any conflict. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
