A 0-1 Integer Programming Model for the Course Scheduling Problem and A Case Study
<p>The course scheduling problem is one of the most common timetabling problems which are frequently encountered in all educational institutions, especially universities. This problem which is getting harder to solve day by day, means the assignment of the lessons and lecturers into the most s...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Bursa Uludag University
2016-01-01
|
| Series: | Uludağ University Journal of The Faculty of Engineering |
| Subjects: | |
| Online Access: | http://mmfdergi.uludag.edu.tr/article/view/5000131881 |
| Summary: | <p>The course scheduling problem is one of the most common timetabling problems which are frequently encountered in all educational institutions, especially universities. This problem which is getting harder to solve day by day, means the assignment of the lessons and lecturers into the most suitable timeslots and classrooms, provided that various constraints are taken into account. These constraints peculiar to the problem are consisted due to various factors such as the characteristics and the rules of the educational institutions, preferences of lecturers, students’ requests and suggestions. In this study, a novel 0-1 integer programming model that considers preferences of lecturers is proposed for the course scheduling problem. The proposed mathematical model is also tested with a case study from Uludag University. Thus, the performance of the mathematical model can be tested and the results can be analyzed. The results of the carried out application show efficient results in preparing a course schedule that meets the preferences of the lecturers and complies with the rules of the institutions.</p> |
|---|---|
| ISSN: | 2148-4147 2148-4155 |