Educational timetabling problems, namely, university examination timetabling, university
course timetabling and school timetabling, are combinatorial optimization problems …

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

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

Variations of the examination timetabling problem have been investigated by the research
community for more than two decades. The common characteristic between all problems is …

In this paper, we investigate adaptive linear combinations of graph coloring heuristics with a
heuristic modifier to address the examination timetabling problem. We invoke a …

In this study, we investigate an adaptive decomposition and ordering strategy that
automatically divides examinations into difficult and easy sets for constructing an …

Timetabling at large covering many different types of problems which have their own unique
characteristics. In education, the three most common academic timetabling problems are …

Examination timetabling is a well-studied combinatorial optimization problem involving
scheduling a set of examinations into a restricted number of time-slots while satisfying a …

Sequential constructive algorithm is one of the popular methods for solving timetabling
problems. The concept of the algorithm is to assign event based on their difficulty value by …

In this study, we investigate the effectiveness of cuckoo search algorithm (CSA) for solving
the uncapacitated examination timetabling problem (UETTP). CSA is a popular …