A conflict-aware load-balancing memetic algorithm for examination script vetting allocation

Examination script vetting, as the post-marking review of answer scripts by independent academic staff, is a critical quality assurance process in tertiary institutions. Its allocation to eligible lecturers is typically performed manually in many institutions by coordinators without algorithmic support, resulting in inequitable workload distributions and frequent constraint violations. To the best of our knowledge, no formal computational model exists for the Examination Script Vetting Allocation Problem (ESVAP), leaving institutions without principled, automated allocation support. This study aimed to design and implement a conflict-aware load-balancing memetic algorithm (CALBMA) for optimal examination script vetting allocation and deploy it within a web-based system. The ESVAP is formally modelled as a Binary Quadratic Program with four hard constraints (C1–C3 and C5), including the novel single-program-per-envelope constraint (C5). CALBMA hybridises a genetic algorithm with a constrained swap-based local search. It was implemented in Python and benchmarked against greedy and random allocation baselines on three synthetic datasets using five metrics: Jain's fairness index, within-rank workload variance (WRV), constraint violation rate (CVR), computation time, and Solution Quality Score. CALBMA achieved a CVR of 0 across all datasets, a 34.4-fold WRV reduction over greedy on the medium dataset (2.50 vs. 86.11), and statistically significant superiority confirmed by the Wilcoxon signed-rank test ( p = 0.000002). Evaluation relied solely on synthetic data because no public ESVAP benchmark exists, and real institutional vetting records require institutional approval and data-sharing agreements beyond the scope of this study; the web prototype lacks enterprise-grade security. Institutions should adopt algorithm-driven allocation to eliminate inequity, while future work should extend CALBMA to multi-objective formulations and validate it on real institutional data.

Authors

Institutions

Publication Details

Journal
Frontiers in Education
Published
2026-11-19
DOI
https://doi.org/10.3389/feduc.2026.1930149
Primary Topic
Scheduling and Timetabling Solutions
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A conflict-aware load-balancing memetic algorithm for examination script vetting allocation

Olufunke Oyejoke Oladipupo, Odunayo Damilola Osofuye, Jelili Olanrewaju Oyelade, Adedayo James Adeoba
Frontiers in Education
Scheduling and Timetabling Solutions
article

A conflict-aware load-balancing memetic algorithm for examination script vetting allocation

Olufunke Oyejoke Oladipupo, Odunayo Damilola Osofuye, Jelili Olanrewaju Oyelade, Adedayo James Adeoba
article en

Abstract

Examination script vetting, as the post-marking review of answer scripts by independent academic staff, is a critical quality assurance process in tertiary institutions. Its allocation to eligible lecturers is typically performed manually in many institutions by coordinators without algorithmic support, resulting in inequitable workload distributions and frequent constraint violations. To the best of our knowledge, no formal computational model exists for the Examination Script Vetting Allocation Problem (ESVAP), leaving institutions without principled, automated allocation support. This study aimed to design and implement a conflict-aware load-balancing memetic algorithm (CALBMA) for optimal examination script vetting allocation and deploy it within a web-based system. The ESVAP is formally modelled as a Binary Quadratic Program with four hard constraints (C1–C3 and C5), including the novel single-program-per-envelope constraint (C5). CALBMA hybridises a genetic algorithm with a constrained swap-based local search. It was implemented in Python and benchmarked against greedy and random allocation baselines on three synthetic datasets using five metrics: Jain's fairness index, within-rank workload variance (WRV), constraint violation rate (CVR), computation time, and Solution Quality Score. CALBMA achieved a CVR of 0 across all datasets, a 34.4-fold WRV reduction over greedy on the medium dataset (2.50 vs. 86.11), and statistically significant superiority confirmed by the Wilcoxon signed-rank test ( p = 0.000002). Evaluation relied solely on synthetic data because no public ESVAP benchmark exists, and real institutional vetting records require institutional approval and data-sharing agreements beyond the scope of this study; the web prototype lacks enterprise-grade security. Institutions should adopt algorithm-driven allocation to eliminate inequity, while future work should extend CALBMA to multi-objective formulations and validate it on real institutional data.

Frontiers in EducationVol. 11
Covenant University (NG)
Scheduling and Timetabling Solutions
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon