Skip to main content
Springer Nature Link
Log in

A university-timetabling problem and its solution using Benders’ partitioning—a case study

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In this paper, we address a university-timetabling problem and present a methodology that relies on Benders’ partitioning for its solution. This partitioning results from the special nature of the underlying integer programming formulation for this problem. We have used our methodology to schedule courses offered by the College of Engineering as well as to those offered university-wide at Virginia Tech. The results clearly depict an improvement in the quality of course schedules obtained by our methodology over those currently used, when the performance of a timetable is measured by the total distance traveled by the faculty members from their offices in respective departments to the classrooms, where the courses are offered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Abdennadher, S., & Marte, M. (2000). University course timetabling using constraint handling rules. Journal of Applied Artificial Intelligence, 14, 311–325.

    Article  Google Scholar 

  • Alvarez-Valdes, R., Crespo, E., & Tamarit, J. M. (2002). Design and implementation of a course scheduling system using Tabu search. European Journal of Operational Research, 137, 512–523.

    Article  Google Scholar 

  • Al-Yakoob, S. M., & Sherali, H. D. (2006). A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations. European Journal of Operational Research, 73, 488–507.

    Article  Google Scholar 

  • Aubin, J., & Ferland, J. A. (1989). A large scale timetabling problem for a high school. Computers and Operations Research, 16(1), 67–77.

    Article  Google Scholar 

  • Badri, M. A. (1996). A two-stage multiobjective scheduling [faculty-course-time] assignments. European Journal of Operational Research, 94, 16–28.

    Article  Google Scholar 

  • Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problem. Numerische Mathematik, 4(3), 238–252.

    Article  Google Scholar 

  • Birbas, T., Daskalaki, S., & Housos, E. (1997). Timetabling for Greek high schools. The Journal of the Operational Research Society, 48(12), 1191–1200.

    Article  Google Scholar 

  • Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140, 266–280.

    Article  Google Scholar 

  • Burke, E. K., Jackson, K., Kingston, J. H., & Weare, R. (1997). Automated university timetabling: The state of the art. The Computer Journal, 40(9), 565–571.

    Article  Google Scholar 

  • Burke, E. K., MacCathy, B., Petrovic, S., & Qu, R. (2000). Structured cases in case-based reasoning—re-using and adapting cases for time-tabling problems. Knowledge Based Systems, 13(2–3), 159–165.

    Article  Google Scholar 

  • Burke, E. K., Bykov, Y., & Petrovic, S. (2001a). A multicriteria approach to examination timetabling. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol. 2079. Practice and theory of automated timetabling (pp. 118–131). Berlin: Springer.

    Chapter  Google Scholar 

  • Burke, E. K., MacCarthy, B., Petrovic, S., & Qu, R. (2001b). Case based reasoning in course timetabling: An attribute graph approach. Case based reasoning research and development. In Lecture notes in computer science : Vol. 2080. Proceedings of the 4th international conference on case-based reasoning, ICCBR-2001 (pp. 90–104). Berlin: Springer.

    Google Scholar 

  • Burke, E. K., MacCathy, B., Petrovic, S., & Qu, R. (2006). Multiple-retrieval cost-based reasoning for course timetabling problem. Journal of the Operational Research Society, 57(2), 148–162.

    Google Scholar 

  • Burke, E. K., McCollum, B., Meisels, A., Petrovic, S., & Qu, R. (2007). A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research, 176(1), 177–192.

    Article  Google Scholar 

  • Carrasco, M. P., & Pato, M. V. (2001). A multiobjective genetic algorithm for the class/teacher timetabling problem. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol. 2079. Practice and theory of automated timetabling (pp. 3–17). Berlin: Springer.

    Chapter  Google Scholar 

  • Carter, M. W. (2001). A comprehensive course timetabling and student scheduling system at the University of Waterloo. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol. 2079. Practice and theory of automated timetabling (pp. 64–82). Berlin: Springer.

    Chapter  Google Scholar 

  • Carter, M. W., & Laporte, G. (1998). Recent developments in practical course timetabling. In E. K. Burke & M. W. Carter (Eds.), Lecture notes in computer science : Vol. 1408. Practice and theory of automated timetabling II: Selected papers from the 2nd international conference, Toronto (pp. 3–19). Berlin: Springer.

    Google Scholar 

  • Daskalaki, S., Birbas, T., & Housos, E. (2004). An integer programming formulation for a case study in university timetabling. European Journal of Operational Research, 153, 117–135.

    Article  Google Scholar 

  • Deris, S. B., Omatu, S., Ohta, H., & Samat, P. (1997). University timetabling by constraint-based reasoning: A case study. Journal of the Operational Research Society, 48, 1178–1190.

    Article  Google Scholar 

  • Dimopoulou, M., & Miliotis, P. (2001). Implementation of a university course and examination timetabling system. European Journal of Operational Research, 130, 202–213.

    Article  Google Scholar 

  • Hinkin, R. T., & Thompson, G. M. (2002). SchedulExpert: Scheduling courses in the Cornell University School of Hotel Administration. Interfaces, 32(6), 45–57.

    Article  Google Scholar 

  • Malim, M. R., Khader, T., & Mustafa, A. (2006). Artificial immune algorithms for university timetabling. In E. K. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling (pp. 234–245).

  • McCollum, B. (1997). The implementation of a central timetabling system in a large British Civic University. In Lecture notes in computer science : Vol. 1408. 2nd international conference on the practice and theory of automated timetabling (pp. 237–254). Berlin: Springer.

    Chapter  Google Scholar 

  • McCollum, B. (2006). University timetabling: bridging the gap between research and practice. In E. K. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling (pp. 15–35).

  • MirHassani, S. A. (2006). A computational approach to enhancing course timetabling with integer programming. Applied Mathematics and Computation, 175, 814–822.

    Article  Google Scholar 

  • Papoutsis, K., Valouxis, C., & Housos, E. (2003). A column generation approach for the timetabling problem of Greek high schools. Journal of the Operational Research Society, 54(3), 230–238.

    Article  Google Scholar 

  • Perzina, R. (2006). Solving the university timetabling problem with optimized enrollment of students by a parallel self-adaptive genetic algorithm. In E. K. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling (pp. 264–280).

  • Petrovic, S., & Burke, E. K. (2004). University timetabling. In J. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. New York: CRC Press. Chap. 45.

    Google Scholar 

  • Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87–127.

    Article  Google Scholar 

  • T’kindt, V., & Billaut, J.-C. (2002). Multicriteria scheduling: Theory, models and algorithms. Berlin: Springer.

    Google Scholar 

  • Tripathy, A. (1984). School timetabling—a case in large binary integer linear programming. Management Science, 30(12), 1473–1489.

    Article  Google Scholar 

  • van den Broek, J., Hurkens, C., & Woeginger, G. (2006). Timetabling problems at the TU Eindhoven. In E. K. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling (pp. 141–156).

Download references

Author information

Authors and Affiliations

  1. Grado Department of Industrial and System Engineering, Virginia Tech, 250 Durham Hall, Blacksburg, VA, 24061, USA

    Subhash C. Sarin, Yuqiang Wang & Amrusha Varadarajan

Authors
  1. Subhash C. Sarin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuqiang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amrusha Varadarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Subhash C. Sarin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sarin, S.C., Wang, Y. & Varadarajan, A. A university-timetabling problem and its solution using Benders’ partitioning—a case study. J Sched 13, 131–141 (2010). https://doi.org/10.1007/s10951-009-0157-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-009-0157-1

Search

Navigation