SOLVING POLYTECHNIC EXAMINATION TIME TABLING PROBLEM USING GENERAL TREE PERMUTATION ALGORITHM

Authors: ISAH, ADAMU DAGAH(Department Of Computer Science Niger State Polytechnic Zungeru Niger State, Nigeria) ADAMU MAMMAN (Department Of Computer science Federal Polytechnic Bida, Nigeria

Journal: Nigerian Journal Of Technical Education | Volume: 22 | Issue: 1 | Pages: 15 - 25

Keywords:Examination Time-Table, General Tree Algorithm,Scheduling

Abstract

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.