Course scheduling using genetic algorithm methods

The timetabling problem is a high-dimensional, non-Euclidean, multi-constraint combinational optimization problem. Given, data sets of classes, their days and instructors;. rooms and their capacities, types; students and their preferences and requirements; the problem is to construct a feasible class schedule satisfying all the hard constraints and minimizing the medium and soft constraints. We apply Genetic Algorithms (GAs) to solve the scheduling problem mapped from the Faculty of Science at University of Jordan. This technique has achieved very good results compared to the hand made schedule result produced by the registration department.