time-table scheduling
DESCRIPTION
Time-table SchedulingTRANSCRIPT
Time-table Scheduling
Onur BOZ
Şafak DİRİK
Ahmet DURAN
Index
What is timetable scheduling? In which kinds of problems we can use
timetable scheduling? What types of applications in timetable
scheduling? Our Article The objective and constraints Solution steps and alternatives in Lingo Conclusion
Timetable scheduling can be seen as a form of scheduling where the task is to allocate activities to available slots in resources respecting some constraints.
Solving timetabling problems
Operational Research Approaches Graph Coloring Flow problems Mathematical programming
Solving timetabling problems
There are some more complex approaches
to solve timetabling problems Genetic Algorithms Tabu search
Genetic Algorithms
The process starts with an initial population of solutions
Each timetable is evaluated according to a set of criteria
Tabu search
Tabu search is an effective local search method which moves step by step from one initial solution of a combinatorial optimization problem
The Problem is ;
A multi objective course scheduling problem;
Faculty-Course-Time Block Assignment
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
31 Courses 12 Faculty Members 17 Time-Blocks Priorities
Problem’s Inputs
Constraints
Constraints
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