The University Timetabling Problem: Modeling and Solution Using Binary Integer Programming with Penalty Functions Moustapha Abdellahi and Hussein Eledum
The University Course Timetabling Problem is a particular type of scheduling problems known as a difficult problem arising in academic institutions, and an application of combinatorial optimization. The problem consists of a coordination of lectures, students, teachers
and classrooms to avoid clashes between them. In this work, we address a course timetabling problem encountered at Taibah University. A binary integer programming model of the problem is proposed and a solution methodology based on an exterior penalty function and two new penalty functions, called variance-penalty function and pseudo-convex combination-penalty function, is developed. Solving this problem aims to minimize the waiting time between lectures for students and teachers and preventing clashes of lectures and classrooms.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.