Exam Timetable Scheduler

Graph-coloring based examination scheduling system

0
Classes
0
Subjects
0
Exam Entries
0
Time Slots Used

Scheduling Settings

How the system works

Each exam is represented as a vertex. Two exams are connected when they belong to the same class. A graph-coloring algorithm assigns different colors (time slots) to connected exams.
StepWhat happens
1. Manage dataAdd or edit classes and subjects.
2. Assign subjectsSelect which subjects each class has.
3. Build graphSubjects in the same class become conflicting vertices.
4. Color graphGreedy coloring assigns exams to available slots without conflicts.
5. Generate timetableColored vertices are displayed as exam time slots.

Classes

Create and manage examination classes.

Subjects

Create and manage exam subjects.

Class Subjects

Assign subjects to each class. This creates the scheduling conflicts.

Exam Rooms

Manage rooms and seating capacities for exam allocation.

Conflict Graph

Vertices represent subjects; edges represent class conflicts.

Subject Conflict Details

Generated Timetable

Generate a timetable after setting up your classes and subjects.

Information

Project overview and graph-theory concepts used by Exam Flow.

About Exam Flow

Exam Flow is an examination timetable scheduling system designed as an application of Graph Theory. The administrator manages classes, subjects and rooms, assigns subjects to classes, and the system generates a conflict-free timetable.

Main idea: Exam Timetabling can be modeled as a Graph Coloring Problem. A vertex represents an exam/subject, an edge represents a conflict, and a color represents an exam time slot.

1. Vertex

Each subject that has been assigned to at least one class becomes a vertex in the conflict graph.

2. Edge

Two subject vertices are connected when they belong to the same class. They therefore cannot be scheduled in the same time slot.

3. Graph Coloring

The system assigns a color to each vertex so adjacent vertices receive different colors.

4. Greedy Algorithm

Subjects are processed from higher conflict degree to lower degree. Each subject receives the first available color not used by its neighbors.

5. Chromatic Number

The number of colors used by the coloring is the timetable's required number of distinct exam slots under this coloring. It is a practical upper bound produced by the greedy method; the true minimum may be lower.

6. Time Slots

Each color becomes one exam slot. A day contains two slots: 9:00 AM–12:00 PM and 1:00 PM–4:00 PM.

7. Room Allocation

For each scheduled exam, Exam Flow selects a room with enough capacity. If several exams share a slot, it tries to give each exam a different suitable room.

8. Validation

Before and after scheduling, the system checks duplicate assignments, missing subjects, conflicts, room capacity .

Scheduling Flow

Classes & Subjects → Class-Subject Assignments → Conflict Graph → Greedy Graph Coloring → Colors become Time Slots → Day Mapping → Room Allocation → Final Timetable