A Comparative Study of Modern Heuristics on the School Timetabling Problem

Katsaragakis, Iosif V.; Tassopoulos, Ioannis X.; Beligiannis, Grigorios N.

doi:10.3390/a8030723

Cited by 12 publications

(11 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Step II: main model is solved lecturers' preferences as well as their rank and saturation margins. Some revised works deal either with the same problem type (L-S) such as Hultberg and Cardoso (1997) or include it in a broader one: L-S-T-C such as Badri (1996), Badri et al (1998), Al-Yakoob andSherali (2006), Skoullis et al (2017) or L-S-T, such as Ismayilova et al (2007), Tassopoulos and Beligiannis (2012), Katsaragakis et al (2015), Fonseca et al (2017) and Tassopoulos et al (2020). However, as justified below, these works do not address some of the peculiarities of the problem under study.…”

Section: Our Papermentioning

confidence: 99%

A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules

2021

View full text Add to dashboard Cite

In this paper, an optimization tool based on a MILP model to support the teaching assignment process is proposed. It considers not only hierarchical issues among lecturers but also their preferences to teach a particular subject, the non-regular time schedules throughout the academic year, different type of credits, number of groups and other specific characteristics. Besides, it adds restrictions based on the time compatibility among the different subjects, the lecturers' availability, the maximum number of subjects per lecturer, the maximum number of lecturers per subject as well as the maximum and minimum saturation level for each lecturer, all of them in order to increase the teaching quality. Schedules heterogeneity and other features regarding the operation of some universities justify the usefulness of this model since no study that deals with all of them has been found in the literature review. Model validation has been performed with two real data sets collected from one academic year schedule at the

show abstract

Section: Our Papermentioning

confidence: 99%

A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules

2021

View full text Add to dashboard Cite

show abstract

“…Estas definiciones generales permiten entender que la organización de horarios se aplica a una gran cantidad de contextos que abarcan la educación, la industria, el deporte, la salud, entre otros, y por tanto el interés en encontrar la mejor forma de hacerlo sobrepasa los fines académicos de las ciencias. Además, en este tipo de problemas es común encontrar restricciones de obligatorio cumplimento, así como condiciones que pueden ser quebrantadas sin que la solución pierda factibilidad ni validez [7]; a estas restricciones se les conoce como duras y blandas respectivamente.…”

Section: Revisión De La Literaturaunclassified

Modelo lineal para la programación de clases en una institución educativa

Ángel

Duque

2016

ing.cienc.

View full text Add to dashboard Cite

ResumenEl presente trabajo presenta un modelo de programación matemática que permite la obtención de un horario académico en instituciones de educación primaria y secundaria de diferente tamaño, cantidades de grupos y materias, considerando restricciones que frecuentemente debe enfrentar quien esta encargado del proceso de planeación. El objetivo del modelo propuesto se diferencia de aquellos encontrados en la literatura referida a este tema, ya que propende la creación de horarios maximizando la cantidad de bloques por materias, es decir asignaciones de dos horas seguidas de la misma clase, lo que favorece el proceso de aprendizaje, beneficia la agenda de los profesores al disminuir tiempos ociosos entre clases, y favorece los costos y acuerdos contractuales con la institución. El modelo es aplicado al caso particular de una institución educativa obteniendo resultados que mejoran considerablemente la calidad de la programación de clases respecto a la que actualmente está en uso. Adicionalmente, se desarrollan experimentos computacionales con instancias de mayor tamaño para validar el comportamiento del modelo, obteniendo resultados promisorios.Palabras clave: programación entera; problema de asignación de horarios; complejidad computacional.

show abstract

“…The first kind of constraints, as its name implies, is used for representing the constraints in which a feasible timetable must be satisfied (Henry Obit, 2010). Meanwhile, the second kind of constraints stands for the constraints that a feasible timetable could be violated (Katsaragakis et al, 2015). This kind of constraints is utilized to measure the quality of a timetable.…”

Section: Introductionmentioning

confidence: 99%

An SHO-based approach to timetable scheduling: a case study

Nguyen

2021

Journal of Information and Telecommunication

View full text Add to dashboard Cite

University timetable scheduling, which is a typical problem that all universities around the world have to face every semester, is an NPhard problem. It is the task of allocating the right timeslots and classrooms for various courses by taking into account predefined constraints. In the current literature, many approaches have been proposed to find feasible timetables. Among others, swarm-based algorithms are promising candidates because of their effectiveness and flexibility. This paper investigates proposing an approach to university timetable scheduling using a recent novel swarm-based algorithm named Spotted Hyena Optimizer (SHO) which is inspired by the hunting behaviour of spotted hyenas. Then, a combination of SA and SHO algorithms also investigated to improve the overall performance of the proposed method. We also illustrate the proposed method on a real-world university timetabling problem in Vietnam. Experimental results have indicated the efficiency of the proposed method in comparison to other competitive metaheuristic algorithm such as PSO algorithm in finding feasible timetables.

show abstract

A Comparative Study of Modern Heuristics on the School Timetabling Problem

Cited by 12 publications

References 23 publications

A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules

A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules

Modelo lineal para la programación de clases en una institución educativa

An SHO-based approach to timetable scheduling: a case study

Contact Info

Product

Resources

About