Integer programming has always been an alternative for formulating combinatorial problems
such as the university timetabling problem. However, the effort required for modeling …

The typical course timetabling problem is assigning Classes of students to appropriate
faculty members, suitable classrooms and available timeslots. Hence, it involves a large …

This work presents a metaheuristic with distributed processing that finds solutions for an
optimization model of the university course timetabling problem, where collective …

A column generation (CG) approach for the solution of timetabling problems is presented.
This methodology could be used for various instances of the timetabling problem, although …

The research presented in this PhD thesis focuses on the problem of university course
timetabling, and examines the various ways in which metaheuristics, hyperheuristics and …

University course timetabling is one of the important and time consuming issues that each
University is involved with it at the beginning of each. This problem is in class of NP-hard …

This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for
solving course timetabling problems. The term hyper-heuristics has recently been employed …

Ders ve sınavlara ait zaman çizelgelerinin oluşturulması, başta üniversiteler olmak üzere,
bütün eğitim kurumları için oldukça yorucu ve zaman alan bir faaliyettir. Ders programı …

Graph colouring is a combinatorial optimisation problem consisting in colouring the vertices
of a graph such that no vertices connected by an edge receive the same colour. The minimal …

La asignación de horarios de clases en una Institución de Educación Superior es un
problema complejo debido a la cantidad de restricciones que presenta y el criterio con el …