Abstract
The generation of timetables has always been so tedious right from time and apart from being tedious, the timetable created has always been filled with series of errors and mistakes. So many techniques have been put forward to solving this problem. In this paper, genetic Algorithm was used in other to find a solution to the timetable problem. The system administrator logs into the system and then the administrator input the courses with their codes and the unit. At that point, the admin will keep adding until the number of courses needed has been inputted. The admin can remove a course that has been inputted in the case of error. After inputting the courses, it moves to the next page where all the lecture halls or rooms that will be used will be inputted. After inputting these, the system then generates the timetable system. This technique (genetic algorithm) used helps in reducing to minimum errors and mistakes in encountered in developing an automatic timetable. Keywords : Automatic; timetable; generation; genetic; algorithm; DOI : 10.7176/CEIS/10-4-04 Publication date :May 31 st 2019
Highlights
The class timetabling problem is a scheduling algorithm with great interest and implications in the fields of operational research and artificial intelligence
The problem was first studied by Gotlieb, who formulated a classteacher timetabling problem by considering that each lecture contained one group of students and one teacher, such that the combination of teacher and students can be chosen freely
The class timetabling problem is a typical scheduling problem that appears to be a tedious job in every academic institute once or twice a year (Datta et al, 2005)
Summary
The class timetabling problem is a scheduling algorithm with great interest and implications in the fields of operational research and artificial intelligence. The class timetabling problem is a typical scheduling problem that appears to be a tedious job in every academic institute once or twice a year (Datta et al, 2005). Timetabling is known to be a non-polynomial complete problem i.e. there is no known efficient way to locate a solution. The most striking characteristic of NP-complete problems is that, no best solution to them is known. In order to find the solution to a timetabling problem, a heuristic approach is chosen. This heuristic approach, therein, leads to a set of good solutions
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
