Local search techniques for large high school timetabling problems

Authors:
A. Schaerf
Affiliations:
Dept. di Ingegneria Elettrica, Udine Univ.
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Year:
1999

Citing 0
Cited 18

Hyperheuristics: A Robust Optimisation Method Applied to Nurse Scheduling

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Modelling and Solving Employee Timetabling Problems

Annals of Mathematics and Artificial Intelligence
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms

Software—Practice & Experience
A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem

Journal of Experimental Algorithmics (JEA)
Applying evolutionary computation to the school timetabling problem: The Greek case

Computers and Operations Research
Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem

Journal of Scheduling
Anytime local search for distributed constraint optimization

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
School timetabling for quality student and teacher schedules

Journal of Scheduling
Anytime local search for distributed constraint optimization

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Very large-scale neighborhood search techniques in timetabling problems

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A case study for timetabling in a dutch secondary school

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
eClasSkeduler: A Course Scheduling System for the Executive Education Unit at the Universidad de Chile

Interfaces
Parallelizing a CLIPS-based course timetabling expert system

Expert Systems with Applications: An International Journal
Cyclic transfers in school timetabling

OR Spectrum
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice

Journal of Scheduling
Feature selection in a fuzzy student sectioning algorithm

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A hybrid network intrusion detection system using simplified swarm optimization (SSO)

Applied Soft Computing
Population based Local Search for university course timetabling problems

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

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 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 local search techniques. The algorithm alternates different techniques and different types of moves and makes use of an adaptive relaxation of the hard constraints. The implementation of the algorithm has been successfully experimented with in some large high schools with various kinds of side constraints