House Allocation Problems with Existing Tenants and Priorities for Teacher Recruitment

Tomás, Ana Paula

doi:10.1007/978-3-319-73117-9_34

Cited by 1 publication

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, some works pay special attention not only to the time availability of the professors [9,13,27] but also to preferences regarding certain sessions on a day or certain days per week, such as preferring to teach in the morning, afternoon, or evening, or having a few days off near the weekend [2]. In addition, other details such as change of residence can be contemplated, as in [29] where the house allocation with existing tenants, priorities, and preferences for teacher recruitment is studied and also three algorithms were proposed.…”

Section: Introductionmentioning

confidence: 99%

University Course Timetabling Problem with Professor Assignment

Arratia-Martinez

Maya-Padron²,

Avila-Torres

2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

One of the decision problems in many organizations and institutions is to decide how to schedule different tasks, in particular, in higher education institutions. One of the main problems is the university course timetabling problem (UCTP): this problem consists of the allocation of events (courses, professors, and students) to a number of fixed time slots and rooms, this at the beginning of each academic period of the universities. The existent formulations include particular requirements from different educational levels and institutions, as in our case. In this paper, we focus on the university course timetabling problem with the assignment of professor-course-time slot for an institution in Mexico. Timetabling is constructed for the disciplinary courses that are offered by one of the academic departments. The main characteristics are as follows: (1) there are full-time and part-time professors; (2) a mandatory fixed number of courses has to be assigned to each full-time professor according to their academic profile; (3) there is a maximum number of courses assigned to part-time professors; (4) a professor-course matrix that specifies the valid assignation is defined; and (5) mandatory time periods for courses in different semesters are established and other traditional constraints. We present the integer linear programming model proposed to solve the case studied. The optimal solution was obtained with low computational effort through the classical branch-and-bound algorithm. We describe the complete timetable to show the model effectiveness.

show abstract