Some experiments with a timetabling system

Ostermann, Roman C.; Werra, Dominique de

doi:10.1007/bf01719788

Cited by 16 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Some approaches have been proposed to solve this problem. Early methods include direct heuristics [3], graph coloring [4,5], integer programming [6][7][8], network flow techniques [9,10], all of which have a limitation on the scale of the problem. With the development of computer technology, especially since the 1990s, an increasing number of intelligent algorithms have been applied to solve the timetabling problem, such as genetic algorithm [11][12][13], simulated annealing algorithm [14], taboo search algorithm [15] and hybrid algorithm [16,17].…”

Section: Introductionmentioning

confidence: 99%

Solving UTP Containing Combining Classes using GA

He-nan¹,

Zhang²

2014

IJUNESST

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Solving UTP Containing Combining Classes using GA

He-nan¹,

Zhang²

2014

IJUNESST

View full text Add to dashboard Cite

show abstract

“…Most of the early techniques were based on the human way to solve the school timetabling problem (STP), where a timetable is constructed scheduling lecture by lecture [SS80]. Later on, researchers started to apply more general techniques, developing algorithms based on integer programming [Tri84], network flow [OdW82] and graph coloring [NT74]. More recently, successful approaches appeared that use metaheuristics, more proeminently those algorithms based on simulated annealing [AKD99], tabu search [SMO03,Sch96], genetic algorithms [Fan94] and GRASP [SMO03].…”

Section: Introductionmentioning

confidence: 99%

A GRASP strategy for a more constrained School Timetabling Problem

Moura

Scaraficci

2010

IJOR

View full text Add to dashboard Cite

This work treats a typical Brazilian school timetabling problem, that consists of scheduling a set of lectures and teachers in a prefixed period of time, satisfying a set of operational requirements. We applied a basic GRASP heuristic, followed by a pathrelinking improvement. The algorithms use a local search procedure that interleaves two types of movements and a path-relinking strategy that is enhanced with a local search procedure. They were tested with real instances and proved to be good approaches to treat this problem. Although some restrictions are specific to the Brazilian educational institutions, the same ideas can inspire similar approaches for solving the school timetabling problem in other situations.

show abstract

“…Dentre as abordagens e técnicas de solução de um PTP, podem ser destacadas: heurísticas diretas (Junginger, 1986), redução ao problema de coloração de um grafo (Neufeld & Tartar, 1974; de Werra, 1997), fluxo em redes (Ostermann & de Werra, 1983) e as meta-heurísticas Busca Tabu (Costa, 1994;Schaerf, 1996), Simulated Annealing (Abramson, 1991), Algoritmos Genéticos (Colorni et al, 1998;Filho et al, 2001), entre outras.…”

Section: Introductionunclassified

Programação da grade de horário em escolas de ensino fundamental e médio

2008

View full text Add to dashboard Cite

ResumoA programação da grade de horários em escolas de ensino fundamental e médio, também conhecido como problema turma-professor (PTP), consiste em fixar uma seqüência de agendamentos de aulas envolvendo professores e grupos de estudantes (que possuem um mesmo currículo de disciplinas) em um período pré-determinado (tipicamente uma semana), sujeito a requisitos didáticos, físicos e organizacionais. É um problema combinatorial NP-completo e é geralmente resolvido através da aplicação de procedimentos heurísticos. Neste trabalho, apresentamos um procedimento de Busca Tabu associado a uma Busca Local Aleatória e duas formulações matemáticas. O procedimento proposto foi experimentado com sucesso em escolas públicas brasileiras.Palavras-chave: agendamento em escolas; meta-heurísticas; otimização combinatória. AbstractThe school timetabling problem (STP) consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying organizational, pedagogical and personal constraints. STP is a NP-complete problem and is usually tackled using heuristic methods. In this work we considered typical characteristics of Brazilian public schools. We presented a Tabu Search procedure associated with a Randomized Local Search to solve this problem and two mathematical formulations. The implementation of the procedure has been successfully experimented in some Brazilian public schools.

show abstract

Some experiments with a timetabling system

Cited by 16 publications

References 8 publications

Solving UTP Containing Combining Classes using GA

Solving UTP Containing Combining Classes using GA

A GRASP strategy for a more constrained School Timetabling Problem

Programação da grade de horário em escolas de ensino fundamental e médio

Contact Info

Product

Resources

About