A BINARY INTEGER PROGRAMMING MODEL FOR EXAM SCHEDULING PROBLEM WITH SEVERAL DEPARTMENTS

Authors : Emre ASLAN, Türker ŞİMŞEK, Atila KARKACIER

Pages : 169-175

View : 14 | Download : 17

Publication Date : 2017-12-19

Article Type : Other Papers

Abstract :The problem of exam scheduling is a kind of scheduling problem which is studied academically, in which the exams of a certain number of courses is assigned to specific time intervals taking certain constraints into consideration. In most faculties of universities, exam schedules are made manually, which is both time-consuming and error-prone. The objective of this study is to develop a mathematical model that can solve exam scheduling problem in a shorter time than manual schedules and without error. Minimizing total number of classrooms assigned is determined as the objective function of the model. When the total number of classrooms assigned is minimized, the number of tasks per exam invigilator (exam superviser or assistant, proctor)  is also minimized. A binary integer programming model is developed for this purpose.
Keywords : Exam scheduling, timetabling, mathematical model