A BINARY INTEGER PROGRAMMING MODEL FOR EXAM SCHEDULING PROBLEM WITH SEVERAL DEPARTMENTS
Autor: | ASLAN, Emre, ŞİMŞEK, Türker, KARKACIER, Atila |
---|---|
Rok vydání: | 2017 |
Předmět: | |
Zdroj: | Volume: 12, Issue: 2 169-175 Bilgi Ekonomisi ve Yönetimi Dergisi |
ISSN: | 1308-3937 |
Popis: | The problem of examscheduling is a kind of scheduling problem which is studied academically, inwhich the exams of a certain number of courses is assigned to specific timeintervals taking certain constraints into consideration. In most faculties ofuniversities, exam schedules are made manually, which is both time-consumingand error-prone. The objective of this study is to develop a mathematical modelthat can solve exam scheduling problem in a shorter time than manual schedulesand without error. Minimizing total number of classrooms assigned is determinedas the objective function of the model. When the total number of classrooms assignedis minimized, the number of tasks per exam invigilator (exam superviser orassistant, proctor) is also minimized. Abinary integer programming model is developed for this purpose. |
Databáze: | OpenAIRE |
Externí odkaz: |