The (a)social exam invigilator assignment problem
Hannah Verplancke et al.
What the paper says
The invigilator assignment problem provides an assignment of invigilators, also called proctors, to a predetermined exam timetable with given invigilator demand. We provide three problem variants with a focus on invigilator-timeslot preferences and socialization aspects. We prove that the variant with timeslot preferences is polynomially solvable, whereas incorporating socialization aspects makes the problem $$\mathcal{N}\mathcal{P}$$ -hard. Hence, we also provide a heuristic approach and show its effectiveness based on real-life benchmark instances, arising from a case study conducted at Ghent University. Furthermore, we introduce and evaluate artificial instances based on well-known exam timetabling instances from the literature. Finally, we discuss the practical implications and key insights derived from the case study.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.