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 …

Since university timetabling is commonly classified as a combinatorial optimisation problem,
researchers tend to use optimisation approaches to reach the optimal timetable solution …

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 …

Academic institutions may be edging towards a global uncertainty, recession, and a string of
financial difficulties. An effective course timetabling is one of managerial strategies to …

Population-based approaches regularly are better than single based (local search)
approaches in exploring the search space. However, the drawback of population-based …

One of the decision problems in many organizations and institutions is to decide how to
schedule different tasks, in particular, in higher education institutions. One of the main …

The harmony search algorithm has been proven to be an effective optimization method for
solving diverse optimization problems. However, due to its slow convergence, the …

University timetabling problems are a yearly challenging task and are faced repeatedly each
semester. The problems are considered nonpolynomial time (NP) and combinatorial …

In this study, we present a local search-based algorithm for the post-enrollment-based
course timetabling problem, which incorporates a mechanism for adapting the …