In this paper, an interactive model for academic resource timetabling using constraint
programming with Google OR-Tools' CP-SAT is developed and tested. This model is …

Scheduling is one of the problems which so many researches have been conducted on it
over the years. The university course timetabling problem which is an NP-hard problem is a …

Abstract The University Course Scheduling Problem (UCSP) is a highly constrained real-
world combinatorial optimization task. Solving UCSP means creating an optimal course …

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 …

One of the main challenges for university administration is building a timetable for course
sessions. This is not just about building a timetable that works, but building one that is as …

The university course timetabling problem (UCTP) is a combinatorial optimization problem,
in which a set of events has to be scheduled into time slots and located into suitable rooms …

In this work, we propose a variant of the honey-bee mating optimization algorithm for solving
educational timetabling problems. The honey-bee algorithm is a nature inspired algorithm …

University course timetabling problem (UCTP) is considered to be a hard combinatorial
optimization problem to assign a set of events to a set of rooms and timeslots. Although …

The post-enrolment course timetabling (PE-CTT) is one of the most studied timetabling
problems, for which many instances and results are available. In this work we design a …

Finding a good university timetabling system is not a simple task for a higher educational
organisation. As a result, many approaches to generating sufficiently good solutions have …