A generalized class–teacher model for some timetabling problems

Asratian, Armen S.; Werra, Dominique de

doi:10.1016/s0377-2217(01)00342-3

Cited by 62 publications

(27 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For more exhaustive and detailed surveys related to academic timetabling problems, the reader may refer to Sandhu [14], Asratian and de Werra [3], and Schaerf [15]. In particular, Sandhu [14] provides a comprehensive review of the enormous body of literature, giving a chronological presentation of timetabling along with insights into the evolution of approaches from the first manual heuristic procedure through the present state-of-art computer-based methods.…”

Section: Related Researchmentioning

confidence: 99%

“…Daskalaki et al [7] developed a 0-1 integer programming model for a university timetabling problem, which incorporates many of the operational rules and requirements that are found in academic institutions. Asratian and De Werra [3] have considered a generalized class-teacher model that extends the basic class-teacher model of timetabling. This model corresponds to situations that occur, for example, in the basic training programs of universities and schools.…”

Section: Related Researchmentioning

confidence: 99%

See 1 more Smart Citation

A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations

Al-Yakoob

Sherali

2007

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Related Researchmentioning

confidence: 99%

Section: Related Researchmentioning

confidence: 99%

A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations

Al-Yakoob

Sherali

2007

European Journal of Operational Research

View full text Add to dashboard Cite

“…En el año 2000, (Deris et al 2000) diseñaron una solución basada en definiciones combinatorias y algoritmos dinámicos. En 2002, Asratian y Werra (2002), formularon un nuevo modelo matemático con algunas nuevas restricciones y propiedades, considerando un problema general con N profesores y M materias.…”

Section: Introductionunclassified

Combinación entre Algoritmos Genéticos y Aleatorios para la Programación de Horarios de Clases basado en Ritmos Cognitivos

Castrillón

2014

Inf. tecnol.

View full text Add to dashboard Cite

ResumenSe ha diseñado un método basado en algoritmos evolutivos (genéticos y aleatorios) para programar los horarios de clases en una universidad. Esta metodología considera los ritmos cognitivos de los estudiantes que indican que es mejor enseñar algunas asignaturas en intervalos específicos de tiempo. Primero se describen las diferentes técnicas empleadas para desarrollar este problema. Luego se propone una nueva metodología basada en ritmos cognitivos y algoritmos evolutivos, para resolver todas las restricciones duras y blandas del problema. Finalmente se comparan diferentes metodologías para establecer cuál es la más eficiente. Se concluye que los algoritmos evolutivos son más eficientes que otras técnicas empleadas (19.5%) en la programación de horarios universitarios. Palabras clave: programación, horarios universitarios, algoritmos genéticos, función objetivo, restricciones Combination Between Genetic and Random Algorithms for Programing Class Schedule based on Cognitive Rhythms AbstractA method based on evolutionary algorithms (genetics and random) to plan class schedules in a university has been developed. This methodology considers the students' cognitive rhythms, which indicate that it is better to teach some subjects in some specific time intervals. First, the different techniques to solve this problem are described. Then, a new methodology based on cognitive rhythms and evolutionary algorithms is proposed, to solve the hard and soft constraints. Finally, different methodologies are compared to determine the most efficient one. It is concluded that evolutionary algorithms are more efficient than others techniques (19.5%) for planning class schedules.

show abstract

“…Many aspects of this model have been studied in (de Werra 1985(de Werra , 1997de Werra et al 2002;Asratian and de Werra 2002).…”

Section: Introductionmentioning

confidence: 99%

A computational study of local search algorithms for Italian high-school timetabling

et al. 2007

View full text Add to dashboard Cite

In this paper we report on a computational experience with a local search algorithm for High-school Timetabling Problems. The timetable has to satisfy "hard" requirements, that are mandatory, and should minimize the violation of "soft" constraints. In our approach, we combine Simulated Annealing with a Very Large-Scale Neighborhood search where the neighborhood is explored by solving an Integer Programming problem. We report on a computational experience validating the usefulness of the proposed approach.

show abstract

A generalized class–teacher model for some timetabling problems

Cited by 62 publications

References 13 publications

A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations

A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations

Combinación entre Algoritmos Genéticos y Aleatorios para la Programación de Horarios de Clases basado en Ritmos Cognitivos

A computational study of local search algorithms for Italian high-school timetabling

Contact Info

Product

Resources

About