The timetabling problem is common to academic institutions such as schools, colleges or
universities. It is a very hard combinatorial optimisation problem which attracts the interest of …

This paper presents a review pertaining to assignment problem within the education
domain, besides looking into the applications of the present research trend, developments …

Graph colouring is one of those rare examples in the mathematical sciences of a problem
that, while easy to state and visualise, has many aspects that are exceptionally difficult to …

Scheduling is one of the problems that has attracted the attention of many researchers over
the years. The University Course Timetabling Problem (UCTP) is a highly constrained real …

The university course timetabling problem (UCTP) arises every academic year and must be
solved by academic staff with/without a course timetabling tool. A Hybrid Self-adaptive …

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 …

In this work, we are addressing the post enrollment course timetabling (PE-CTT) problem.
We combine different local search algorithms into an iterative two stage procedure. In the …

In this paper, we utilise a two-stage approach for addressing the post enrolment course
timetabling (PE-CTT) problem. We attempt to find a feasible solution in the first stage. The …

The post enrolment course timetabling problem (PECTP) is one type of university course
timetabling problems, in which a set of events has to be scheduled in time slots and located …

We address the post enrolment course timetabling (PE-CTT) problem in this paper. PE-CTT
is known as an NP-hard problem that focuses on finding an efficient allocation of courses …