2020/05/19 by Giulia Caselli, Caselli, Giulia, Maxence Delorme +3
Decision Sciences · #Computers and Society (cs.CY) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Scheduling and Timetabling Solutions
paper · pdf · doi:10.48550/arxiv.2005.09442
openalex publication_date 2020/05/19 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28
In the Tutor Allocation Problem, the objective is to assign a set of tutors\nto a set of workshops in order to maximize tutors' preferences. The problem is\nsolved every year by many universities, each having its own specific set of\nconstraints. In this work, we study the tutor allocation in the School of\nMathematics at the University of Edinburgh, and solve it with an integer linear\nprogramming model. We tested the model on the 2019/2020 case, obtaining a\nsignificant improvement with respect to the manual assignment in use. Further\ntests on randomly created instances show that the model can be used to address\ncases of broad interest. We also provide meaningful insights on how input\nparameters, such as the number of workshop locations and the length of the\ntutors' preference list, might affect the performance of the model and the\naverage number of preferences satisfied.\n