| dc.description.abstract | The university examination timetabling problems are a complex combinatorial problem encountered in many real-world applications. This thesis presents a literature review on exact and methods that have been proposed for its solution and aimed to apply constraint programming to solve a University examination timetabling problem. In common, the university examination timetabling problem is solved to schedule all course with minimize timeslot and satisfy all constraints including the proctors, students, rooms and special requirements from all departments. In this research, multiple preferences of International University-National University (IU) participants were introduced, and the objective problem is approached using constraint programming. The model can be solved by, CPLEX software, any constraints programming solvers available. In the result, the feasible solution with no violation against the preferences is selected.
Keywords: Examination timetabling, constraint programming, university timetabling, time interval variables. | en_US |
