1 / 16

Presented by: Amira Gamaleldin Marlien Edward Mounir Stino

GUC Students Presentation. Using Constraint Programming to solve timetabling problems. Presented by: Amira Gamaleldin Marlien Edward Mounir Stino. Who are we?. Amira Gamaleldin Marlien Edward Mounir Stino. Where do we come from?.

kohana
Download Presentation

Presented by: Amira Gamaleldin Marlien Edward Mounir Stino

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. GUC Students Presentation Using Constraint Programming to solve timetabling problems Presented by: Amira Gamaleldin Marlien Edward Mounir Stino

  2. Who are we? Amira Gamaleldin Marlien Edward Mounir Stino

  3. Where do we come from?

  4. What will we do here? Constraint Programming And Constraint Handling Rules

  5. Problem • Examination Timetable that applies all constraints • Invigilation Timetable of tutors invigilating

  6. Solution • Using CP and CHR to find a solution to the examination problem • Certain inputs and organizational constrains will be given and the output will be the possible timetables

  7. Inputs 1. Students to be examined. • Student Identification: Name and ID of the student. • Courses: All the courses that the student takes.

  8. Inputs 2. Rooms available for examinations. • Room name. • Room capacity.

  9. Inputs 3. Examination Timings. • Days: Available days for examinations. • Working hours: Hours of the day in which exams can take place. • Gaps between exams.

  10. Inputs 4. Courses. • Name. • Duration. • Difficulty rating: To define the difficulty of the course.

  11. Inputs 5. Invigilators. • Invigilator Identification: Name and ID. • Vacation day. • Courses taught. • Available times.

  12. Hard Constraints • No student can have more than one exam at the same time • There should be a minimum gap between exam sessions • In the case that the number of exams is more than the examination days available for a student, then the course difficulty level should be used to decide which exams to put on the same day • Invigilators cannot come in their unavailable times

  13. Hard Constraints (contd) • The total number of sessions invigilated by tutors of the same position should be the same • A tutor could or could not invigilate a course that he teaches * • A tutor could or could not invigilate one day before an exam of the course he teaches * • The number of consecutive sessions invigilated cannot exceed a certain number * ** These constrains will be inputted from the user according to the requirements of the current examination period

  14. Soft Constraints • Use larger rooms more frequently than smaller ones • Student’s examination place should not change frequently • Exam schedule should be spread out as far as possible for each student • Invigilators should not come on day-off unless under extreme conditions

  15. Questions???

  16. Thank you!

More Related