%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP
%@archivingpolicy denypublisher denyfinaldraft12
%@issn 0302-9743
%@resumeid
%@resumeid 8JMKD3MGP5W/3C9JHMQ
%@usergroup administrator
%@usergroup sergio
%3 a constructive.pdf
%B Applications of Evolutionary Computing Proceedings
%@dissemination WEBSCI; PORTALCAPES.
%X This work presents a constructive approach to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. The problem is modeled as a bi-objective problem used as a basis to construct feasible assignments of teachers to classes on specified timeslots. A new representation for the timetabling problem is presented. Pairs of teachers and classes are used to form conflict-free clusters for each timeslot. Teacher preferences and the process of avoiding undesirable waiting times between classes are explicitly considered as additional objectives. Computational results over real test problems are presented.
%T A Constructive evolutionary approach to school timetabling
%K COMPUTER SCIENCE, Genetic algorithms, School timetabling, COMPUTAÇÃO APLICADA, Algoritmos genéticos, Carga horária escolar.
%@secondarytype PRE PI
%@group LAC-INPE-MCT-BR
%@copyholder SID/SCD
%@secondarykey INPE-11208-PRE/6657
%2 sid.inpe.br/marciana/2004/08.13.10.06.04
%@affiliation Universidade Mogi das Cruzes (UMC/INPE)
%@affiliation Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC),
%@project Algoritmos genéticos
%@language English
%P 130-139
%4 sid.inpe.br/marciana/2004/08.13.10.06
%D 2001
%V 2037
%A Ribeiro Filho, Geraldo,
%A Lorena, Luiz Antonio Nogueira,
%@ 0302-9743
%@area COMP