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...

university course timetabling is a complex optimizationproblem. there are many components like departments, faculties, rooms,and students making the problem huge and difficult to solve. eachcomponent enforces a set of normally conflicting constraints on thesolution space. the problem will be solved if courses are scheduled indifferent rooms and within some specific time slots such that a set of...

Examination timetabling has been a widely studied research problem for over 30 years, with many techniques being used to produce good quality solutions. The majority of the techniques rely on producing an initial solution using a constructive heuristic, and then improving it via a local search [1,2,3], relying on the correct setting of internal parameters to allow generally acceptable results f...

In this contribution a comparative study of modern heuristics on the school timetabling problem is presented. More precisely, we investigate the application of two population-based algorithms, namely a Particle Swarm Optimization (PSO) and an Artificial Fish Swarm (AFS), on the high school timetabling problem. In order to demonstrate their efficiency and performance, experiments with real-world...

Although they have been investigated for more than two decades, university examination timetabling problems are still considered challenging and interesting problems. In our study, we are investigating student preferences for the control of the time gaps between examinations; specifically, what students consider to be best for them and also fair between students. To support this, we conducted a...