ExamPlanner: Examination Seating and Faculty Duty Management System

Abstract - Manual coordination of university examinations and cheating which directly hurts the core integrity of educational testing. To avoid these problems modern computer-driven frameworks usually separate the problem into isolated tasks handling student layouts and faculty assignments as independent steps. Approximate metaheuristics such as Genetic Algorithms, Simulated Annealing or simple greedy selection methods are common because these resource problems are mathematically classified as polynomial-time hard (NP-hard) complexities [10]. But approximate heuristics have academic limits: they react strongly to the first parameters often get stuck, in local optima and give no mathematical promise of perfect optimality [2]. As a result institutions must accept resource schedules that're not optimal that frequently clash with employee availability windows and that do not separate branch peers effectively [2]. This research presents ExamPlanner, an optimization framework that handles student seating layouts and faculty duty scheduling at the same time. Unlike methods that use stochastic searching ExamPlanner turns institutional policies directly into an exact mathematical model solved by Google OR-Tools' CP-SAT constraint programming solver [2]. The system runs on a cloud-native Supabase (PostgreSQL) database that keeps full relational data models across university branches and departments. Importantly the platform adds a dynamic "Algorithmic Critique" interaction mechanism [2]. This engine stops manual administrator layout changes through a web interface. Checks them against the live constraint matrix instantly moving from automated guessing to a reliable human-in-the-loop validation process [2].

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24156577
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

ExamPlanner: Examination Seating and Faculty Duty Management System

Akshata V. Dighe, Mansi S. Metkar, Kavita R. Bhabad, Tejal M. More et al.
Zenodo (CERN European Organization for Nuclear Research)
Scheduling and Timetabling Solutions
article

ExamPlanner: Examination Seating and Faculty Duty Management System

Akshata V. Dighe, Mansi S. Metkar, Kavita R. Bhabad, Tejal M. More, Ritika S. Ambrale
article en

Abstract

Abstract - Manual coordination of university examinations and cheating which directly hurts the core integrity of educational testing. To avoid these problems modern computer-driven frameworks usually separate the problem into isolated tasks handling student layouts and faculty assignments as independent steps. Approximate metaheuristics such as Genetic Algorithms, Simulated Annealing or simple greedy selection methods are common because these resource problems are mathematically classified as polynomial-time hard (NP-hard) complexities [10]. But approximate heuristics have academic limits: they react strongly to the first parameters often get stuck, in local optima and give no mathematical promise of perfect optimality [2]. As a result institutions must accept resource schedules that're not optimal that frequently clash with employee availability windows and that do not separate branch peers effectively [2]. This research presents ExamPlanner, an optimization framework that handles student seating layouts and faculty duty scheduling at the same time. Unlike methods that use stochastic searching ExamPlanner turns institutional policies directly into an exact mathematical model solved by Google OR-Tools' CP-SAT constraint programming solver [2]. The system runs on a cloud-native Supabase (PostgreSQL) database that keeps full relational data models across university branches and departments. Importantly the platform adds a dynamic "Algorithmic Critique" interaction mechanism [2]. This engine stops manual administrator layout changes through a web interface. Checks them against the live constraint matrix instantly moving from automated guessing to a reliable human-in-the-loop validation process [2].

Zenodo (CERN European Organization for Nuclear Research)
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