The timetabling problem is common to academic institutions such as schools, colleges or universities. It a very hard combinatorial optimisation which attracts the interest of many researchers. university course (UCTTP) difficult address due size and several challenging soft constraints. Over years, various methodologies were proposed solve UCTTP. purpose this survey paper provide most recent sc...

The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...

Scheduling is one the problems on which so many researches have been done over years and university course timetabling problem which is a NP-hard problem is a type of scheduling problem. On the other hand, timetabling process must be done for each semester frequently which is an exhausting and time consuming task. University course timetabling problem performs the allocation of whole events to ...

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

The Resource-Constrained Project Scheduling Problem (RCPSP) is concerned with single-item or small batch production where limited resources have to be allocated to dependent activities over time. Over the past few decades, a lot of work has been made with the use of optimal solution procedures for this basic problem type and its extensions. Brucker and Knust[1] discuss, how timetabling problems...