...

  • Home
  • Articles
    • Current Issue
    • Archives
  • Authors
    • Author Guidelines
    • Policies
    • Downloads
  • Editors
  • Reviewers
...

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 72 | Issue 10 | Year 2026 | Article Id. IJMTT-V72I10P104 | DOI : https://doi.org/10.14445/22315373/IJMTT-V72I10P104

Mixed-Integer Programming Optimisation for University Course Timetabling Problem


Jared Ongaro, Benjamin Kikwai
Received Revised Accepted Published
21 Aug 2026 27 Sep 2026 14 Oct 2026 28 Oct 2026
Citation :

Jared Ongaro, Benjamin Kikwai, "Mixed-Integer Programming Optimisation for University Course Timetabling Problem," International Journal of Mathematics Trends and Technology (IJMTT), vol. 72, no. 10, pp. 45-52, 2026. Crossref, https://doi.org/10.14445/22315373/IJMTT-V72I10P104

Abstract
This paper presents a comprehensive solution to the University Course Timetabling Problem (UCTP) through the lens of a flexible Mixed-Integer Programming (MIP) model. The model is designed to generate conflict-free schedules by assigning courses to instructors, rooms, and time slots, while minimising a weighted penalty function that rigorously quantifies soft objectives related to student conflicts, inefficient room utilisation, and instructor preferences. A key contribution is the provision of a practical, end-to-end implementation guide using an entirely open-source Python stack (Pandas, PuLP, CBC). This demonstration outlines the complete workflow, from simple CSV data inputs to a verifiable, human-readable timetable. The full implementation code is made publicly available for reproducibility. We conclude by analysing the inherent computational scalability challenges of this exact MIP approach and propose hybrid solution methodologies as a promising direction for future research on large-scale, real-world instances.
Keywords
Combinatorial Optimisation, Course Scheduling, Curriculum-Based Timetabling, Mixed-Integer Programming, Open-Source Solvers, Python, University Timetabling.
References

[1] Michael W. Carter, and Gilbert Laporte, “Recent Developments in Practical Course Timetabling,” International Conference on the Practice and Theory of Automated Timetabling, Brno, Czech Republic, vol. 1408, pp. 3-19, 1998.
[CrossRef] [Google Scholar] [Publisher Link]

[2] Anthony Wren, “Scheduling, Timetabling and Rostering -- A Special Relationship?,” International Conference on the Practice and Theory of Automated Timetabling, vol. 1153, pp. 46-75, 1996.
[
CrossRef] [Google Scholar] [Publisher Link]

[3] Christian Blum, and Andrea Roli, “Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison,” ACM Computing Surveys, vol. 35, no. 3, pp. 268-308, 2003.
[
CrossRef] [Google Scholar] [Publisher Link]

[4] Rhydian Lewis, “A Survey of Metaheuristic-based Techniques for University Timetabling Problems,” OR Spectrum, vol. 30, no. 1, pp. 167-190, 2008.
[CrossRef] [Google Scholar] [Publisher Link]

[5] Edward Tsang, Foundations of Constraint Satisfaction, Computation in Cognitive Science, London, UK: Academic Press, 1993.
[CrossRef] [Google Scholar] [Publisher Link]

[6] Sophia Daskalaki, Theodore Birbas, and Efthymios C. Housos, “An Integer Programming Formulation for a Case Study in University Timetabling,” European Journal of Operational Research, vol. 153, no. 1, pp. 117-135, 2004.
[
CrossRef] [Google Scholar] [Publisher Link]

[7] Dominique de Werra, “An Introduction to Timetabling,” European Journal of Operational Research, vol. 19, no. 2, pp. 151-162, 1985.
[CrossRef] [Google Scholar] [Publisher Link]

[8] Andrea Schaerf, “A Survey of Automated Timetabling,” Artificial Intelligence Review, vol. 13, no. 2, pp. 87-127, 1999.
[CrossRef] [Google Scholar] [Publisher Link]

[9 ]Shimon Even, Alon Itai, and Adi Shamir, “On the Complexity of Timetable and Multi-Commodity Flow Problems,” Proceedings of the 16th Annual Symposium on Foundations of Computer Science, USA, pp. 184-193, 1975.
[
CrossRef] [Google Scholar] [Publisher Link]

[10] Tim B. Cooper, and Jeffrey H. Kingston, “The Complexity of Timetable Construction Problems,” Practice and Theory of Automated Timetabling, vol. 1153, pp. 281-295, 1996.
[CrossRef] [Google Scholar] [Publisher Link]

[11] Antony E. Phillips et al., “Integer Programming for Minimal Perturbation Problems in University Course Timetabling,” Annals of Operations Research, vol. 252, no. 2, pp. 283-304, 2017.
[CrossRef] [Google Scholar] [Publisher Link]

[12] Leonardo S.L. Bastos et al., “A Mixed Integer Programming Approach to the Patient Admission Scheduling Problem,” European Journal of Operational Research, vol. 273, no. 3, pp. 831-840, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[13] James C. Chu, “Mixed-Integer Programming Model and Branch-and-Price-and-Cut Algorithm for Urban Bus Network Design and Timetabling,” Transportation Research Part B: Methodological, vol. 108, pp. 188-216, 2018.
[
CrossRef] [Google Scholar] [Publisher Link]

[14] Paul Shaw, “Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems,” Principles and Practice of Constraint Programming, vol. 1520, pp. 417–431, 1999.
[CrossRef] [Google Scholar] [Publisher Link]

[15] Laurence A. Wolsey, Integer Programming, New York, NY: John Wiley & Sons, 2020.
[Google Scholar] [Publisher Link]

[16] George L. Nemhauser, and Laurence A. Wolsey, “Integer and Combinatorial Optimization,” New York, NY: Wiley-Interscience, 1988.
[Google Scholar] [Publisher Link]

[17] Iain Dunning, Stuart Mitchell, and Michael O'Sullivan, “Pulp: A Linear Programming Toolkit for Python,” 2011.
[Google Scholar] [Publisher Link]

  • PDF
  • Citation
  • Abstract
  • Keywords
  • References
Citation Abstract Keywords References
  • Home
  • Authors Guidelines
  • Paper Submission
  • APC
  • Archives
  • Downloads
  • Open Access
  • Publication Ethics
  • Copyrights Infringement
  • Journals
  • FAQ
  • Contact Us

Follow Us

Copyright © 2026 Seventh Sense Research Group® . All Rights Reserved