AN INTEGER PROGRAMMING APPROACH FOR CURRICULUM BASED TIMETABLING PROBLEM SOLUTION

Academic timetabling problems a class of NP-Hard type problem which cannot be solved in polynomial time. In literature, these problems are studied under two different main topics which are curriculum and post-enrollment based timetabling problems. In this paper, curriculum based timetabling problem is entirely reviewed then timetabling procedure of Ataturk University Engineering Faculty is analyzed. The problem which is handled in this paper is not only a lean lecture assigning problem but also including several constraints related to lecture given departments and classes (student groups). In this study an integer linear model is proposed to maximize the satisfaction of teaching staff from timetable according to their appellation and numerical results, obtained from solution of a small sized sample, are evaluated.