Preference-based assignment of university students to multiple teaching groups

DOI10.1007/s00291-013-0332-9zbMath1305.90187OpenAlexW2005339529MaRDI QIDQ480755

Wolfgang Brüggemann, Henrik Heitmann

Publication date: 11 December 2014

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-013-0332-9

zbMATH Keywords

mixed-integer programminguniversity timetablingacademic timetablingstudents-scheduling problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items

Elective course assignment problem: a revenue management based approach ⋮ Balance in resource allocation problems: a changing reference approach ⋮ Data-driven fair resource allocation for novel emerging epidemics: a COVID-19 Convalescent Plasma case study ⋮ The stable tournament problem: matching sports schedules with preferences ⋮ Bounds on the average and minimum attendance in preference-based activity scheduling ⋮ The balanced maximally diverse grouping problem with block constraints ⋮ A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values

Uses Software

• CPLEX
• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• Application of a real-world university-course timetabling model solved by integer programming
• Distribution requirements and compactness constraints in school timetabling
• Efficient solutions for a university timetabling problem through integer programming
• Timetabling problems at the TU Eindhoven

This page was built for publication: Preference-based assignment of university students to multiple teaching groups