Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

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

Abstract

[EN] 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 Politecnica de Valencia.Solano Cutillas, P.; Pérez Perales, D.; Alemany Díaz, MDM. (2022). A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules. Operational Research. 22(3):2899-2942. https://doi.org/10.1007/s12351-021-00638-12899294222

Similar works

Full text

thumbnail-image

RiuNet

redirect
Last time updated on 28/11/2022

This paper was published in RiuNet.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.