0
Upcoming SlideShare
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Standard text messaging rates apply

# Time-table Scheduling

5,897

Published on

Time-table …

Time-table
Scheduling

1 Comment
2 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• i need your this project code for my project query plz send me on hardikp2010@gmaail.com

Are you sure you want to  Yes  No
Views
Total Views
5,897
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
283
1
Likes
2
Embeds 0
No embeds

No notes for slide

### Transcript

• 1. Time-table Scheduling Onur BOZ Şafak DİRİK Ahmet DURAN
• 2. 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
• 3.
• 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.
• 4. Solving timetabling problems
• Operational Research Approaches
• Graph Coloring
• Flow problems
• Mathematical programming
• 5. Solving timetabling problems
• There are some more complex approaches
• to solve timetabling problems
• Genetic Algorithms
• Tabu search
• 6. Genetic Algorithms
• The process starts with an initial population of solutions
• Each timetable is evaluated according to a set of criteria
• 7. Tabu search
• Tabu search is an effective local search method which moves step by step from one initial solution of a combinatorial optimization problem
• 8. The Problem is ;
• A multi objective course scheduling problem;
• Faculty-Course-Time Block Assignment
• 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
• 10.
• 31 Courses
• 12 Faculty Members
• 17 Time-Blocks
• Priorities
Problem’s Inputs
• 11.
• 12.
• 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
• 16.
• 17.
• 18.