Skip to main content
Erschienen in: OR Spectrum 3/2014

01.07.2014 | Regular Article

Preference-based assignment of university students to multiple teaching groups

verfasst von: Henrik Heitmann, Wolfgang Brüggemann

Erschienen in: OR Spectrum | Ausgabe 3/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Burke E, Jackson K, Kingston JH, Weare R (1997) Automated university timetabling: the state of the art. Comput J 40(9):565–571CrossRef Burke E, Jackson K, Kingston JH, Weare R (1997) Automated university timetabling: the state of the art. Comput J 40(9):565–571CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat 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) 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)
Zurück zum Zitat de Werra D (1985) An introduction to timetabling. Eur J Oper Res 19(2):151–162 de Werra D (1985) An introduction to timetabling. Eur J Oper Res 19(2):151–162
Zurück zum Zitat Drexl A, Salewski F (1997) Distribution requirements and compactness constraints in school timetabling. Eur J Oper Res 102(1):193–214CrossRef Drexl A, Salewski F (1997) Distribution requirements and compactness constraints in school timetabling. Eur J Oper Res 102(1):193–214CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat French S (1989) Decision theory: an introduction to the mathematics of rationality. In: Mathematics and its applications (Ellis Horwood Ltd). Prentice Hall, Englewood Cliffs French S (1989) Decision theory: an introduction to the mathematics of rationality. In: Mathematics and its applications (Ellis Horwood Ltd). Prentice Hall, Englewood Cliffs
Zurück zum Zitat 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) 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)
Zurück zum Zitat 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) 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)
Zurück zum Zitat Laporte G, Desroches S (1986) The problem of assigning students to course sections in a large engineering school. Comput Oper Res 13(4):387–394CrossRef Laporte G, Desroches S (1986) The problem of assigning students to course sections in a large engineering school. Comput Oper Res 13(4):387–394CrossRef
Zurück zum Zitat Lewis R, Paechter B (2007) Finding feasible timetables using group-based operators. IEEE Trans Evol Comput 11(3):397–413CrossRef Lewis R, Paechter B (2007) Finding feasible timetables using group-based operators. IEEE Trans Evol Comput 11(3):397–413CrossRef
Zurück zum Zitat Schaerf A (1999) A survey of automated timetabling. Artif Intell Rev 13(2):87–127CrossRef Schaerf A (1999) A survey of automated timetabling. Artif Intell Rev 13(2):87–127CrossRef
Zurück zum Zitat Schimmelpfeng K, Helber S (2007) Application of a real-world university-course timetabling model solved by integer programming. OR Spectr 29:783–803CrossRef Schimmelpfeng K, Helber S (2007) Application of a real-world university-course timetabling model solved by integer programming. OR Spectr 29:783–803CrossRef
Zurück zum Zitat van den Broek J, Hurkens C, Woeginger G (2009) Timetabling problems at the TU Eindhoven. Eur J Oper Res 196(3):877–885CrossRef van den Broek J, Hurkens C, Woeginger G (2009) Timetabling problems at the TU Eindhoven. Eur J Oper Res 196(3):877–885CrossRef
Zurück zum Zitat Young HP (1995) Equity: in theory and practice. Princeton University Press, Princeton Young HP (1995) Equity: in theory and practice. Princeton University Press, Princeton
Metadaten
Titel
Preference-based assignment of university students to multiple teaching groups
verfasst von
Henrik Heitmann
Wolfgang Brüggemann
Publikationsdatum
01.07.2014
Verlag
Springer Berlin Heidelberg
Erschienen in
OR Spectrum / Ausgabe 3/2014
Print ISSN: 0171-6468
Elektronische ISSN: 1436-6304
DOI
https://doi.org/10.1007/s00291-013-0332-9

Weitere Artikel der Ausgabe 3/2014

OR Spectrum 3/2014 Zur Ausgabe