Optimal student sectioning on mandatory courses with various sections numbers

DOI10.1007/s10479-017-2621-1zbMath1410.90094OpenAlexW2751010249MaRDI QIDQ1730755

David Schindl

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hesso.tind.io/record/2293/files/Postprint.pdf

zbMATH Keywords

timetablingstudent sectioningconflict graph

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Decomposition of university course timetabling. A systematic study of subproblems and their complexities

Cites Work

• Unnamed Item
• Unnamed Item
• A complexity analysis and an algorithmic approach to student sectioning in existing timetables
• Tabu search for large scale timetabling problems
• Assigning students to course sections using tabu search
• Towards improving the utilization of university teaching space
• Split Vertices in Vertex Colouring and Their Application in Developing a Solution to the Faculty Timetable Problem

This page was built for publication: Optimal student sectioning on mandatory courses with various sections numbers