evidoria

← Back to browse

Good practice Imported

Cornell's Mixed-Integer-Programming Scheduler Eliminates Direct Exam Conflicts for 18,000 Students a Semester

United States of America · Ithaca · See the United States of America profile

Evidence: Observational / pre–post Top 59% 47/100 · Ask Evidence Copilot about this practice

Cornell's Scheduling Team replaced lecture-time-based exam scheduling with a mixed-integer-programming optimizer. Over five semesters (2022-2024) it cut direct conflicts from 376-790 to zero per term for up to 18,000 students, per a peer-reviewed INFORMS study.

376–790 conflicts per semester
Direct exam conflicts under the old lecture-time method
0 conflicts per semester
Direct exam conflicts under the new MIP-optimized schedule (Spring 2022–Spring 2024)
60–75 %
Reduction in 'triples' (three exams within 24 hours) (Spring 2022–Spring 2024)
16,000–18,000 students
Students covered per semester (Spring 2022–Spring 2024)

Details

Maturity
Established
Promoter
Cornell University — Office of the University Registrar / Cornell Scheduling Team
Period
Spring 2022–Spring 2024 (5 consecutive semesters)
Keywords
higher education, university administration, operations research

Context

For decades, Cornell University assigned final-exam slots using each course's regular lecture time, a method that produced hundreds of same-day and back-to-back conflicts every December as students juggled overlapping majors and minors.

Activities

Starting in Spring 2022, the university's Scheduling Team — led by operations-research professor David Shmoys together with Tinghan Ye, Adam Jovine, Willem van Osselaer and Qihan Zhu — replaced this with a mixed-integer-programming (MIP) optimizer that assigns each of roughly 540-600 final exams to one of 19-24 slots per semester, explicitly weighting course co-enrollment to avoid clustering students' exams.

Results

Across five consecutive semesters through Spring 2024 (covering roughly 16,000-18,000 students each term), the optimized schedule eliminated direct same-slot conflicts entirely, down from 376-790 under the old lecture-time method, and cut 'triples' (three exams in 24 hours) by roughly 60-75%. The results were accepted for publication in the peer-reviewed INFORMS Journal on Applied Analytics, and the underlying scheduling complexity — over 2,500 total exams and deliverables across an 8-day period — is independently documented on Cornell's own Network Science course blog.

Conclusions

The approach is purely administrative: it does not touch instruction or curriculum, and the paper reports no measured effect on grades or learning outcomes, only on conflict counts and university operating costs.

Implementation

Indicative cost
Medium (€50k–€500k)
Time to results
Medium (1–3 years)
Staffing & skills
Cornell University Scheduling Team, David Shmoys (operations-research professor), Tinghan Ye, Adam Jovine, Willem van Osselaer, Qihan Zhu (research team)

Conditions for success

  • Existing enrollment/course-registration data available to weight co-enrollment in the optimizer
  • Peer-reviewed methodology (INFORMS Journal on Applied Analytics) supporting institutional buy-in

Common failure modes

  • Purely administrative — no measured effect on grades or learning outcomes, only on conflict counts and operating costs

Commonly funded by

Own resources / municipal budget

Indicative funding routes for practices of this type — always check each programme's current calls and eligibility rules.

Do you run this practice? Claim it — verified implementers get a public contact pathway and can propose corrections.

Data sources

Where this practice's information was retrieved from, and when.

Similar practices you may find useful