We propose a survey of the research contributions on the field of Educational Timetabling
with a specific focus on “standard” formulations and the corresponding benchmark …

Abstract Throughout its history, Operational Research has evolved to include methods,
models and algorithms that have been applied to a wide range of contexts. This …

This paper introduces a new and very simple search methodology called Late Acceptance
Hill-Climbing (LAHC). It is a local search algorithm, which accepts non-improving moves …

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

Exam timetabling is a prominent topic in academic administration management as it ensures
the effective utilization of resources and satisfies the requirements and preferences of …

The exam timetabling problem is considered an NP-complete problem and its complexity
depends on the different constraints and policies set by an institution's administration. The …

Timetabling problems have been widely studied, of which Educational Timetabling Problem
(ETP) is the biggest section. Generally, ETP can be divided into three modules, namely …

Text mining helps to convert big text data into a small amount of most relevant data for a
particular problem, and also helps providing knowledge provenance and interpreting …

We propose a multi-neighbourhood simulated annealing algorithm for the ITC-2007 version
of the capacitated examination timetabling problem. The proposed solver is based on a …

Identifying critical nodes is an efficient way to analyze and apprehend the properties,
structures, and functions of complex networks, which is a challenging NP-hard problem. This …