The examination timetabling problem has been extensively studied since Carter produced a collection of real instances [1] (for a recent survey see [2]). This year, a significant extension to the set of realistic instances has been provided by the examination timetabling track [3] of the 2007 International Timetabling Competition2. The exam track instances are much more realistic than the Carter...

This paper describes our work on applying novel techniques based on propositional satisfiability (SAT) solvers and optimizers to the Curriculum-based Course Timetabling problem. Out of 32 standard benchmark instances derived from the Second International Timetabling Competition held in 2007, our techniques yield the best known solutions for 21 of them (19 of them being optimal), improving the p...

The High School Timetabling Problem consists in assigning timeslots and resources to events, satisfying constraints which heavily depend on the specific institution. This work deals with the problem of the ongoing III International Timetabling Competition (ITC), which includes a diverse set of instances from many educational institutions around the world. We proposed an approach based on Simula...

[7] G. Lajos. Complete university modular timetabling using constraint logic programming. A constraint-based approach to high-school timetabling problems: A case study. 14 problem diculty is observed. 6 Conclusions We have proposed a constraint satisfaction model for a local high school timetabling problem. The problem we have studied involves an assignment of eight weekly periods to the sectio...

Timetabling problems are often hard and timeconsuming to solve. Most of the methods of solving them concern only one problem instance or class. This paper describes a universal method for solving large, highly constrained timetabling problems from different domains. The solution is based on evolutionary algorithm’s framework and operates on two levels – first-level evolutionary algorithm tries ...

This work presents a local search approach to the High School Timetabling Problem. The addressed timetabling model is the one stated in the Third International Timetabling Competition (ITC 2011), which considered many instances from educational institutions around the world and attracted seventeen competitors. Our team, named GOAL (Group of Optimization and Algorithms), developed a solver built...

university course timetabling problem is a serious challenge for the academic managers in each semester. because of a vast number of constraints and the complexity of relationship among the constraints, the problem is known to be of hard class. in this paper, a decision support system is proposed to assist the decision makers in solving the university course timetabling. the proposed system pro...

Timetabling is a crucial and often extremely time consuming task in many educational institutions. This task is generally performed periodically (each year, semester, quarter) for fulfilling the requirements imposed by the institution and people involved, such as students and teachers/lecturers making efficient and effective use of the available resources. The educational timetabling problem ha...

The university course timetabling problem is a combinatorial optimisation problem in which a set of events has to be scheduled in time slots and located in suitable rooms. The design of course timetables for academic institutions is a very difficult task because it is an NP-hard problem. This paper proposes a genetic algorithm with a guided search strategy and a local search technique for the u...

The timetabling problem is concerned with the allocation, subject to constraints, of given resources to objects in space and time in such way as to satisfy as nearly as possible a set of desirable objectives. This problem is known to be NP-complete and as such only combinatorial optimization methods can guarantee an optimal timetable. In this paper we propose a sector-based genetic algorithm fo...