The Educational Timetabling problem deals with the assignment of course (or lecture events) to a limited set of specific timeslots and rooms, subject to a variety of hard and soft constraints. All hard constraints must be satisfied, obtaining a feasible solution. In this paper we establish a new hybrid algorithm to solve course timetabling problem based on Genetic Algorithm and Simulating Annealing algorithm. We perform a hybrdised method on standard benchmark course timetable problems and able to produce promising results.