Course Registration and School Timetabling

A guided research project in Algorithms & Discrete Mathematics.

← Algorithms & Discrete Mathematics projects

Experience Research Algorithms & Discrete Mathematics

Question

How can courses be assigned to students, rooms, and times while satisfying many competing constraints?

The algorithm must satisfy fixed rules while balancing many requests that cannot all be met.
The algorithm must satisfy fixed rules while balancing many requests that cannot all be met.

Goals

  • Build a mathematical model of registration or timetabling constraints.
  • Create and evaluate schedules using real or realistic data.

Method

Express every possible assignment with decision variables, hard rules, and preferences.

  • Record conflicts, capacities, availability, and student choices.
  • Use integer programming, graph methods, or a constructive heuristic.
  • Check feasibility and compare schedules by preference, balance, and running time.