The timetabling problem is common to academic institutions such as schools, colleges or
universities. It is a very hard combinatorial optimisation problem which attracts the interest of …

Matheuristics are heuristic algorithms based on mathematical tools such as the ones
provided by mathematical programming, that are structurally general enough to be applied …

The high school timetabling is a classical combinatorial optimization problem that takes a
large number of variables and constraints into account. Due to its combinatorial nature …

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 …

Efficient scheduling is significant for the effective use of scarce satellite resources. Task
clustering has been demonstrated as an effective strategy for improving the efficiency of …

In this paper, we present our solver for the new variant of the University Timetabling
Problem, which was introduced in the framework of Fourth International Timetabling …

In university buildings with many rooms spread over different floors, large student flows
between two consecutive lectures might cause congestion problems. These congestions …

Over recent years, timetable programming in academic settings has become particularly
challenging due to such factors as the growing number of students, the variety of lectures …

Abstract The Teacher Assignment Problem is part of the University Timetabling Problem and
involves assigning teachers to courses, taking their preferences into consideration. This is a …

This study proposes a simulated annealing with restart strategy (SA_RS) heuristic for the
multiconstraint team orienteering problem with multiple time windows (MC-TOP-MTW), an …