IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v194y2012i1p255-27210.1007-s10479-010-0700-7.html
   My bibliography  Save this article

Curriculum based course timetabling: new solutions to Udine benchmark instances

Author

Listed:
  • Gerald Lach
  • Marco Lübbecke

Abstract

We present an integer programming approach to the university course timetabling problem, in which weekly lectures have to be scheduled and assigned to rooms. Students’ curricula impose restrictions as to which courses may not be scheduled in parallel. Besides some hard constraints (no two courses in the same room at the same time, etc.), there are several soft constraints in practice which give a convenient structure to timetables; these should be met as well as possible. We report on solving benchmark instances from the literature and the 2nd International Timetabling Competition which are based on real data from the university of Udine. The first set is solved to proven optimality; for the second set we give solutions which on average compete well with or beat the previously best known solutions. Our algorithm is not an overall winner, but it is very robust in the sense that it deterministically gives satisfactory lower and upper bounds in reasonable computation time without particular tuning. For slightly larger instances from the literature our approach shows significant potential as it considerably beats previous benchmarks. We further present solutions of proven quality to a few much larger instances with more elaborate hard constraints. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • Gerald Lach & Marco Lübbecke, 2012. "Curriculum based course timetabling: new solutions to Udine benchmark instances," Annals of Operations Research, Springer, vol. 194(1), pages 255-272, April.
  • Handle: RePEc:spr:annopr:v:194:y:2012:i:1:p:255-272:10.1007/s10479-010-0700-7
    DOI: 10.1007/s10479-010-0700-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0700-7
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-010-0700-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Burke, Edmund Kieran & Petrovic, Sanja, 2002. "Recent research directions in automated timetabling," European Journal of Operational Research, Elsevier, vol. 140(2), pages 266-280, July.
    2. Daskalaki, S. & Birbas, T. & Housos, E., 2004. "An integer programming formulation for a case study in university timetabling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 117-135, February.
    3. Daskalaki, S. & Birbas, T., 2005. "Efficient solutions for a university timetabling problem through integer programming," European Journal of Operational Research, Elsevier, vol. 160(1), pages 106-120, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Esmaeilbeigi, Rasul & Mak-Hau, Vicky & Yearwood, John & Nguyen, Vivian, 2022. "The multiphase course timetabling problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1098-1119.
    2. Biniyam Asmare Kassa, 2015. "Implementing a Class-Scheduling System at the College of Business and Economics of Bahir Dar University, Ethiopia," Interfaces, INFORMS, vol. 45(3), pages 203-215, June.
    3. Mats Carlsson & Sara Ceschia & Luca Gaspero & Rasmus Ørnstrup Mikkelsen & Andrea Schaerf & Thomas Jacob Riis Stidsen, 2023. "Exact and metaheuristic methods for a real-world examination timetabling problem," Journal of Scheduling, Springer, vol. 26(4), pages 353-367, August.
    4. Andrea Bettinelli & Valentina Cacchiani & Roberto Roberti & Paolo Toth, 2015. "An overview of curriculum-based course timetabling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 313-349, July.
    5. Lindahl, Michael & Mason, Andrew J. & Stidsen, Thomas & Sørensen, Matias, 2018. "A strategic view of University timetabling," European Journal of Operational Research, Elsevier, vol. 266(1), pages 35-45.
    6. Britta Herres & Heinz Schmitz, 2021. "Decomposition of university course timetabling," Annals of Operations Research, Springer, vol. 302(2), pages 405-423, July.
    7. Massimiliano Caramia & Stefano Giordani, 2020. "Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study," SN Operations Research Forum, Springer, vol. 1(2), pages 1-21, June.
    8. Mutsunori Banbara & Katsumi Inoue & Benjamin Kaufmann & Tenda Okimoto & Torsten Schaub & Takehide Soh & Naoyuki Tamura & Philipp Wanko, 2019. "$${\varvec{teaspoon}}$$ teaspoon : solving the curriculum-based course timetabling problems with answer set programming," Annals of Operations Research, Springer, vol. 275(1), pages 3-37, April.
    9. Rasmus Ø. Mikkelsen & Dennis S. Holm, 2022. "A parallelized matheuristic for the International Timetabling Competition 2019," Journal of Scheduling, Springer, vol. 25(4), pages 429-452, August.
    10. Cristian D. Palma & Patrick Bornhardt, 2020. "Considering Section Balance in an Integer Optimization Model for the Curriculum-Based Course Timetabling Problem," Mathematics, MDPI, vol. 8(10), pages 1-12, October.
    11. Alexander Kiefer & Richard F. Hartl & Alexander Schnell, 2017. "Adaptive large neighborhood search for the curriculum-based course timetabling problem," Annals of Operations Research, Springer, vol. 252(2), pages 255-282, May.
    12. Bagger, Niels-Christian F. & Sørensen, Matias & Stidsen, Thomas R., 2019. "Dantzig–Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling," European Journal of Operational Research, Elsevier, vol. 272(2), pages 430-446.
    13. Michael Lindahl & Matias Sørensen & Thomas R. Stidsen, 2018. "A fix-and-optimize matheuristic for university timetabling," Journal of Heuristics, Springer, vol. 24(4), pages 645-665, August.
    14. Niels-Christian Fink Bagger & Guy Desaulniers & Jacques Desrosiers, 2019. "Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem," Journal of Scheduling, Springer, vol. 22(2), pages 155-172, April.
    15. Fabian Dunke & Stefan Nickel, 2023. "A matheuristic for customized multi-level multi-criteria university timetabling," Annals of Operations Research, Springer, vol. 328(2), pages 1313-1348, September.
    16. Alejandro Cataldo & Juan-Carlos Ferrer & Jaime Miranda & Pablo A. Rey & Antoine Sauré, 2017. "An integer programming approach to curriculum-based examination timetabling," Annals of Operations Research, Springer, vol. 258(2), pages 369-393, November.
    17. Thepphakorn, Thatchai & Pongcharoen, Pupong & Hicks, Chris, 2014. "An ant colony based timetabling tool," International Journal of Production Economics, Elsevier, vol. 149(C), pages 131-144.
    18. Niels-Christian F. Bagger & Simon Kristiansen & Matias Sørensen & Thomas R. Stidsen, 2019. "Flow formulations for curriculum-based course timetabling," Annals of Operations Research, Springer, vol. 280(1), pages 121-150, September.
    19. Marco Lübbecke, 2015. "Comments on: An overview of curriculum-based course timetabling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 359-361, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Defu & Liu, Yongkai & M'Hallah, Rym & Leung, Stephen C.H., 2010. "A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 550-558, June.
    2. P. Solano Cutillas & D. Pérez-Perales & M. M. E. Alemany Díaz, 2022. "A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules," Operational Research, Springer, vol. 22(3), pages 2899-2942, July.
    3. Andrea Bettinelli & Valentina Cacchiani & Roberto Roberti & Paolo Toth, 2015. "An overview of curriculum-based course timetabling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 313-349, July.
    4. Fabian Dunke & Stefan Nickel, 2023. "A matheuristic for customized multi-level multi-criteria university timetabling," Annals of Operations Research, Springer, vol. 328(2), pages 1313-1348, September.
    5. Pongcharoen, P. & Promtet, W. & Yenradee, P. & Hicks, C., 2008. "Stochastic Optimisation Timetabling Tool for university course scheduling," International Journal of Production Economics, Elsevier, vol. 112(2), pages 903-918, April.
    6. Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová, 2012. "A branch-and-cut procedure for the Udine Course Timetabling problem," Annals of Operations Research, Springer, vol. 194(1), pages 71-87, April.
    7. Vermuyten, Hendrik & Lemmens, Stef & Marques, Inês & Beliën, Jeroen, 2016. "Developing compact course timetables with optimized student flows," European Journal of Operational Research, Elsevier, vol. 251(2), pages 651-661.
    8. De Causmaecker, Patrick & Demeester, Peter & Vanden Berghe, Greet, 2009. "A decomposed metaheuristic approach for a real-world university timetabling problem," European Journal of Operational Research, Elsevier, vol. 195(1), pages 307-318, May.
    9. Domenech, B & Lusa, A, 2016. "A MILP model for the teacher assignment problem considering teachers’ preferences," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1153-1160.
    10. Salem Al-Yakoob & Hanif Sherali, 2015. "A column generation mathematical programming approach for a class-faculty assignment problem with preferences," Computational Management Science, Springer, vol. 12(2), pages 297-318, April.
    11. Biniyam Asmare Kassa, 2015. "Implementing a Class-Scheduling System at the College of Business and Economics of Bahir Dar University, Ethiopia," Interfaces, INFORMS, vol. 45(3), pages 203-215, June.
    12. van den Broek, John & Hurkens, Cor & Woeginger, Gerhard, 2009. "Timetabling problems at the TU Eindhoven," European Journal of Operational Research, Elsevier, vol. 196(3), pages 877-885, August.
    13. Thepphakorn, Thatchai & Pongcharoen, Pupong & Hicks, Chris, 2014. "An ant colony based timetabling tool," International Journal of Production Economics, Elsevier, vol. 149(C), pages 131-144.
    14. Jaime Miranda, 2010. "eClasSkeduler: A Course Scheduling System for the Executive Education Unit at the Universidad de Chile," Interfaces, INFORMS, vol. 40(3), pages 196-207, June.
    15. Salem Al-Yakoob & Hanif Sherali & Mona Al-Jazzaf, 2010. "A mixed-integer mathematical modeling approach to exam timetabling," Computational Management Science, Springer, vol. 7(1), pages 19-46, January.
    16. Raphael Medeiros Alves & Francisco Cunha & Anand Subramanian & Alisson V. Brito, 2022. "Minimizing energy consumption in a real-life classroom assignment problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1149-1175, December.
    17. Sunil B. Bhoi & Jayesh M. Dhodiya, 2024. "Multi-objective faculty course assignment problem based on the double parametric form of fuzzy preferences," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(2), pages 1-16.
    18. Mats Carlsson & Sara Ceschia & Luca Gaspero & Rasmus Ørnstrup Mikkelsen & Andrea Schaerf & Thomas Jacob Riis Stidsen, 2023. "Exact and metaheuristic methods for a real-world examination timetabling problem," Journal of Scheduling, Springer, vol. 26(4), pages 353-367, August.
    19. Song, Kwonsik & Kim, Sooyoung & Park, Moonseo & Lee, Hyun-Soo, 2017. "Energy efficiency-based course timetabling for university buildings," Energy, Elsevier, vol. 139(C), pages 394-405.
    20. Gerhard Post & Samad Ahmadi & Sophia Daskalaki & Jeffrey Kingston & Jari Kyngas & Cimmo Nurmi & David Ranson, 2012. "An XML format for benchmarks in High School Timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 385-397, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:194:y:2012:i:1:p:255-272:10.1007/s10479-010-0700-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.