Loading...

Course Scheduling Problem in Sharif University of Technology

Hassani Goodarzi, Shadi | 2012

369 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 44466 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Salmasi, Naser
  7. Abstract:
  8. This study strives to solve the course scheduling problem based on the constraints in Sharif University. In course scheduling problem, first we need to assign each course to a professor (This is done according to professors’ preferences in Sharif University) then we assign each course to a classroom and a time slot subject to professors, classrooms and time constraints (For example no two courses can be assigned to the same classroom at the same time slot). If solved manually, the solving process will take several days and at best results in a feasible solution. The education department is responsible for scheduling 661courses in five days a week and assigning them to 56 classrooms available. The mathematical model of this assignment problem will take several hours to be written by computer and then we have to wait several days to get a feasible solution using one of commercial solvers. However, we were successful in solving this problem in 30 minutes with the help of two methods: 1) Decomposing the problem into smaller sub-problems that can be solved in a sequence and thus reducing the number of constraints and variables. 2) Using predetermined time intervals instead of assigning a specific time of day to each course. In this manner we can maximize the utility of course timetables produced by assigning the main courses to better time intervals of the day and we can add more constraints (such as non-overlapping time intervals for courses in the same group) to our model while still solving it in a reasonable amount of time
  9. Keywords:
  10. Integer Programming ; Course Scheduling ; Allocation Problem ; Sharif University of Technology

 Digital Object List

 Bookmark

No TOC