The document discusses timetable scheduling and solving timetabling problems. It describes timetable scheduling as allocating activities to available time slots while respecting constraints. It discusses approaches like graph coloring, mathematical programming, genetic algorithms, and tabu search for solving timetabling problems. It then presents a multi-objective course scheduling problem of assigning faculty, courses, and time blocks as an example problem.

1. Time-table Scheduling Onur BOZ Şafak DİRİK Ahmet DURAN

9. One Stage Two Stage The problem can solve in One stage. 1 st Stage: Faculty-Course Assignment 2 nd Stage: Faculty –Course Assignment Assign To time Slots Solution Method

13. Constraints

14. Constraints

15. The Objective Function First Priority (P1) : assign all courses; Second Priority (P2) :satisfy all teaching loads; Third Priority (P5) :satisfy faculty-course priority; Fourth Priority (P4) :satisfy course-time priorites ; Fifth Priority (P3) :satisfy available space for each time- block