The timetabling problems is the most prominent problem in combinatorial optimization.
University Examination Timetabling Problem (UETP) is considered as one of the common …

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

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 …

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 …

Building university timetables is a complex process that considers varying types of
constraints and objectives from one institution to another. The problem solved in this paper …

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 …

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 …

This paper describes the development of a novel metaheuristic that combines an
electromagnetic-like mechanism (EM) and the great deluge algorithm (GD) for the University …