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

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operational research Ročník 22; číslo 3; s. 2899 - 2942
Hlavní autoři: Cutillas, P. Solano, Pérez-Perales, D., Díaz, M. M. E. Alemany
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2022
Springer Nature B.V
Témata:
ISSN:1109-2858, 1866-1505
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 Spanish University Universitat Politècnica de València.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1109-2858
1866-1505
DOI:10.1007/s12351-021-00638-1