Educational timetabling problem is a challenging real world problem which has been of interest to many researchers and practitioners. There are many variants of this problem which mainly require scheduling of events and resources under various constraints. In this study, a curriculum based course timetabling problem at Yeditepe University is described and an iterative selection hyper-heuristic ...

University Course Timetabling (UCT) problem is a combinatorial optimization in which set of events has to be scheduled timeslots and located suitable room by considering all the constraint involved. A feasible timetable plays an important role ensuring tasks or are carried out appropriately. However, producing one not easy task due its large data size variety requirements In this research, math...

Course timetabling is a combinatorial optimization problem and has been confirmed to be an NP-complete problem. Course timetabling problems are different for different universities. The studied university course timetabling problem involves hard constraints such as classroom, class curriculum, and other variables. Concurrently, some soft constraints need also to be considered, including teacher...

Timetabling problems emerge in many variations [9], depending on the nature of the assignments involved (exam timetabling, course timetabling, school timetabling and others), as well as, the characteristics of the institution and the set of constraints assumed. In this communication we focus on a particular school timetabling problem the Class/Teacher Timetabling Problem (CTTP) that will be des...

This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solvin...

The university course timetabling problem involves assigning a given number of events (including lectures, seminars, labs, tutorials, etc) into a limited number of timeslots and rooms subject to given set of constraints. Two primary hard constraints are that no student should be assigned two events in one timeslot and that capacity and features of rooms should satisfy the requirement of the eve...

Yongkai Liu, Defu Zhang and Francis Y.L. Chin Department of Computer Science, Xiamen University, Xiamen 361005, China Department of Computer Science, University of Hong Kong, Hong Kong Abstract Constructing a feasible solution, where the focus is on “hard” constraints only, is an important part of solving timetabling problems. For the University Course Timetabling Problem (UCTP), we propose a h...

Although there has been a fair amount of research in the area of school timetabling, this domain has not developed as well as other fields of educational timetabling such as university course and examination timetabling. This can possibly be attributed to the fact that the studies in this domain have generally been conducted in isolation of each other and have addressed different school timetab...

This paper presents a hybrid evolutionary algorithm to tackle university course timetabling problems. The proposed approach is an extension of a non-linear great deluge algorithm in which evolutionary operators are incorporated. First, we generate a population of feasible solutions using a tailored process that incorporates heuristics for graph colouring and assignment problems. That initialisa...