Work

Tabu Search Techniques for Large High-School Timetabling Problems

Year: 1996

Type: other

Abstract: The high-school timetabling problem regards the weekly scheduling for all the lectures of a high school. The problem consists in assigning lectures to periods in such a way that no teacher (or class) is involved in more than one lecture at a time, and other side constraints are satisfied. The problem is NP-complete and is usually tackled using heuristic methods. This paper describes a solution algorithm (and its implementation) based on tabu search. The algorithm interleaves different types of moves and makes use of an adaptive relaxation of the hard constraints. The implementation of the algorithm has been successfully experimented in some large high schools with various kinds of side constraints.

Source: Data Archiving and Networked Services (DANS)

Author: Andrea Schaerf

Institution: Sapienza University of Rome

Language: English

Topic: Scheduling and Timetabling Solutions

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: green

Funders: European Research Consortium for Informatics and Mathematics, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Centrum Wiskunde and Informatica

OpenAlex ID: W2168400916

Cites:

Cited by: 41

Related to: 10