Genetic algorithm and heuristic search for solving timetable problem case study: Universitas Pelita Harapan timetable

Scheduling problem is a model of complicated problem. Too many things have to be considered in order to arrange a schedule, such as lecturer availabilities, a great number of classes and courses. To overcome this problem, genetic algorithm combined with heuristic search is proposed in this paper. This proposed method was tested several times, and the results show that despite small population, the best schedule still can be obtained.