EXAM TIMETABLING PROBLEM USING GENETIC ALGORITHM

  • . S
N/ACitations
Citations of this article
49Readers
Mendeley users who have this article in their library.

Abstract

Timetabling is an extremely difficult problem which is an element of the wider-field of scheduling. Scheduling is generally defined as the problem of the allocation of resources over time to perform a set of tasks and is NP-hard problems. Scheduling exam timetables in departments of college/university is a complex problem. This is usually done by hand taking several days or weeks of iterative repair after feedback from staff and students. This paper proposed an algorithm to solve the problem of exam timetabling, which is a good candidate to generate a timetable using genetic algorithm (GA). This paper details the implementation of a computer program which employs GA for an optimal solution of solving a timetable problem and generate exam timetable by using real student data from engineering department courses at ICT.

Cite

CITATION STYLE

APA

. S. K. J. (2014). EXAM TIMETABLING PROBLEM USING GENETIC ALGORITHM. International Journal of Research in Engineering and Technology, 03(05), 649–654. https://doi.org/10.15623/ijret.2014.0305120

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free