SOLVING POLYTECHNIC EXAMINATION TIME TABLING PROBLEM USING GENERAL TREE PERMUTATION ALGORITHM
Nigerian Journal of Technical Education · 2025
DOI: 10.63996/njte.v22i1.20 ↗Kurz gefasst
Fachartikel in der Zeitschrift Nigerian Journal of Technical Education, 2025. Verfasst von Abdullahi Abba Dambatta.
Abstract (Originalsprache)
Examination timetable preparation is a tedious task to undertake most especially if it is to be undertaken manually because much human effort and time will be required. Hence the used of General Tree Permutation (GTP) algorithm in preparing polytechnic examination timetable to reduce time wastage and effort required in preparing the timetable. The main motivation for using GTP is its ability to depict various ways a given set of items can be orderly arranged the scheduling of timetable by automatic generation of a path for GTP at a time to form and ordered arrangement in examination timetabling. The results of implementation of the algorithm demonstrated that it can reduce stress in examination timetable preparation and generation.
Zitieren
APA
Dambatta, A. A. (2025). SOLVING POLYTECHNIC EXAMINATION TIME TABLING PROBLEM USING GENERAL TREE PERMUTATION ALGORITHM. Nigerian Journal of Technical Education. https://doi.org/10.63996/njte.v22i1.20
Vancouver
Dambatta AA. SOLVING POLYTECHNIC EXAMINATION TIME TABLING PROBLEM USING GENERAL TREE PERMUTATION ALGORITHM. Nigerian Journal of Technical Education. 2025. doi:10.63996/njte.v22i1.20
BibTeX
@article{Dambatta2025,
author = {Dambatta, Abdullahi Abba},
title = {SOLVING POLYTECHNIC EXAMINATION TIME TABLING PROBLEM USING GENERAL TREE PERMUTATION ALGORITHM},
journal = {Nigerian Journal of Technical Education},
year = {2025},
doi = {10.63996/njte.v22i1.20}
}
EUVIMED