Abstract: This paper presents a hybrid algorithm for solving a timetabling problem, which is commonly encountered in many universities. The problem combines both teacher assignment and course scheduling problems simultaneously, and is presented as a mathematical programming model. However, this problem becomes intractable and it is unlikely that a proven optimal solution can be obtained by an integer programming approach, especially for large problem instances. A hybrid algorithm that combines an integer programming approach, a greedy heuristic and a modified simulated annealing algorithm collaboratively is proposed to solve the problem. Several randomly generated data sets of sizes comparable to that of an institution in Indonesia are solved using the proposed algorithm. Computational results indicate that the algorithm can overcome difficulties of large problem sizes encountered in previous related works.
Abstract: Developing a university course schedule is
difficult. This is due to the limitations in the resources
available. The process is made even harder with different
faculties or departments having different ways of stating their
schedule requirements. The person in charge of taking the
schedule requirements and turning them into a proper course
schedule is not only burden with the task of allocating the
appropriate classes and time to lecturers and students, they
also need to understand the schedule requirements. Therefore
a scheduling support system named SATA is developed to
assist ICRESS in the course scheduling process. SATA has
been put to use for several semesters and the results have been
encouraging. It won a bronze medal in the 2008 Invention,
Innovation and Design competition (IID-08) and has been
submitted to be patented in October 2008