Large-scale timetabling problems with adaptive Tabu search

Abstract

Timetabling problems are specific types of scheduling problems that deal with assigning certain events to the timeslots. This assigning is subject to certain hard constraints that should be achieved to get a feasible timetable, as well as, soft constraints that must meet as many as possible during forming a feasible schedule. In this paper introduces an adaptive tabu search.