Optimal student sectioning on mandatory courses with various sections numbers
From MaRDI portal
Recommendations
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables
- Assigning students to course sections using tabu search
- Elective course student sectioning at Danish high schools
- Scheduling classes on a college campus
- A generalized class-teacher model for some timetabling problems
Cites work
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables
- Assigning students to course sections using tabu search
- scientific article; zbMATH DE number 1728530 (Why is no real title available?)
- scientific article; zbMATH DE number 1728532 (Why is no real title available?)
- Split Vertices in Vertex Colouring and Their Application in Developing a Solution to the Faculty Timetable Problem
- Tabu search for large scale timetabling problems
- Towards improving the utilization of university teaching space
Cited in
(5)- Optimum allocation of places to students in a national university system
- Decomposition of university course timetabling. A systematic study of subproblems and their complexities
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables
- University course timetabling with multi-section courses, room stability and lecturer preferences: an application in a business school
- Curriculum-based university course timetabling considering individual course of studies
This page was built for publication: Optimal student sectioning on mandatory courses with various sections numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730755)
