Hyper-heuristics have recently emerged as a powerful approach to automate the design of
heuristics for a number of different problems. Production scheduling is a particularly popular …

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the
goal of automating the design of heuristic methods to solve hard computational search …

Hyper-heuristics is a fairly recent technique that aims at effectively solving various real-world
optimization problems. This is the first book on hyper-heuristics, and aims to bring together …

Operational Research (OR) techniques have been applied, from the early stages of the
discipline, to a wide variety of issues in education. At the government level, these include …

In recent research, hyper-heuristics have attracted increasing attention in various fields. The
most appealing feature of hyper-heuristics is that they aim to provide more generalized …

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

The resource-constrained project scheduling problem (RCPSP) is one of the scheduling
problems that belong to the class of NP-hard problems. Therefore, heuristic approaches are …

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

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

Resource constraint job scheduling is an important combinatorial optimization problem with
many practical applications. This problem aims at determining a schedule for executing jobs …