Abstract
A successful approach to the student-scheduling problem is presented here. This problem arises naturally when courses and classes must be offered in such a large number of multiple teaching groups that some of these are timetabled in parallel, i.e. simultaneously. This is the case, for example, at the School of Business, Economics and Social Sciences of Universität Hamburg, Germany. Here, 3,735 students have to be assigned in a real-life scenario to 48 courses in 300 multiple teaching groups such that no student has a time clash and students’ enrolments as well as group capacities are met. Students’ satisfaction with regard to individually specified preferences for various aspects of the scheduling can be used as the objective which yields a multi-criteria decision problem. The resulting mixed-integer programme is modelled in GAMS and typical instances can be solved within minutes using the commercial CPLEX solver. Furthermore, the integration of the optimisation approach into the existing registration process using a campus-management software is discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burke E, Jackson K, Kingston JH, Weare R (1997) Automated university timetabling: the state of the art. Comput J 40(9):565–571
Carter MW, Laporte G (1996) Recent developments in practical examination timetabling. In: Practice and theory of automated timetabling. Lecture notes in computer science, vol 1153. Springer, Berlin, pp 1–21
Cheng E, Kruk S, Lipman M (2003) Flow formulations for the student scheduling problem. In: Burke E, De Causmaecker P (eds) Practice and theory of automated timetabling IV. Lecture notes in computer science, vol 2740. Springer, Berlin, pp 299–309
Daskalaki S, Birbas T (2005) Efficient solutions for a university timetabling problem through integer programming. Eur J Oper Res 160(1):106–120 (applications of Mathematical Programming Models)
Datenlotsen (2013) CampusNet. http://www.datenlotsen.de/index.php/de/produkte/campusnet (last download on 25 April 2013 at 1:30 pm)
de Werra D (1985) An introduction to timetabling. Eur J Oper Res 19(2):151–162
Drexl A, Salewski F (1997) Distribution requirements and compactness constraints in school timetabling. Eur J Oper Res 102(1):193–214
Feldman R, Golumbic MC (1989) Constraint satisfiability algorithms for interactive student scheduling. In: Proceedings of the eleventh international joint conference on artificial intelligence. Springer, Berlin, pp 1010–1016
French S (1989) Decision theory: an introduction to the mathematics of rationality. In: Mathematics and its applications (Ellis Horwood Ltd). Prentice Hall, Englewood Cliffs
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New York (addendum updated March 1991)
Heitmann H, Brüggemann W (2012) Experimental study of the students-scheduling problem at the Department of Business Administration, Universität Hamburg, winter semester 2010/11. http://www.uni-hamburg.de/or/pbas (last visit: 06 May 2013, 8.00 p.m)
Laporte G, Desroches S (1986) The problem of assigning students to course sections in a large engineering school. Comput Oper Res 13(4):387–394
Lewis R, Paechter B (2007) Finding feasible timetables using group-based operators. IEEE Trans Evol Comput 11(3):397–413
Schaerf A (1999) A survey of automated timetabling. Artif Intell Rev 13(2):87–127
Schimmelpfeng K, Helber S (2007) Application of a real-world university-course timetabling model solved by integer programming. OR Spectr 29:783–803
Universität Hamburg, Administration (2011) 2nd and 4th semester courses and groups of the summer semester 2011. http://www.wiso.uni-hamburg.de/fileadmin/einrichtungen/studienbuero_wiwi/Vorlesungsverzeichnis/2011-Sommersemester/GESAMT-UEBERSICHT_Bachelor-Uebungsgruppen_SoSe2011.pdf (last visit: 19 Nov 2012, 5.00 p.m)
van den Broek J, Hurkens C, Woeginger G (2009) Timetabling problems at the TU Eindhoven. Eur J Oper Res 196(3):877–885
Young HP (1995) Equity: in theory and practice. Princeton University Press, Princeton
Acknowledgments
This work was partially funded by the Fachbereich Betriebswirtschaftslehre (Department of Business Administration) of the Universität Hamburg from student tuition fees. This is gratefully acknowledged as well as the advice and support provided by the Fachbereich and the company Datenlotsen in Hamburg. In addition, the authors wish to thank the Associate Editor and the three anonymous referees for their valuable comments and suggestions in two revisions which greatly improved the paper.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
Rights and permissions
About this article
Cite this article
Heitmann, H., Brüggemann, W. Preference-based assignment of university students to multiple teaching groups. OR Spectrum 36, 607–629 (2014). https://doi.org/10.1007/s00291-013-0332-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-013-0332-9