A complexity analysis and an algorithmic approach to student sectioning in existing timetables

DOI10.1007/S10951-015-0424-2MaRDI QIDQ310342zbMATH OpenOpenAlexFDO

Authors M. Dostert, A. Politz, H. Schmitz

Publication date 8 September 2016

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-015-0424-2

zbMATH Keywords

complexity analysiseducational timetablingstudent scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 1728530
• A generalized class-teacher model for some timetabling problems
• Complexity of some special types of timetabling problems
• Decomposition of university course timetabling. A systematic study of subproblems and their complexities
• Optimal student sectioning on mandatory courses with various sections numbers

Cites work

• scientific article; zbMATH DE number 1728530 (Why is no real title available?)
• scientific article; zbMATH DE number 1728532 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 3230852 (Why is no real title available?)
• A complexity analysis and an algorithmic approach to student sectioning in existing timetables
• A data structure for dynamic trees
• A large scale timetabling problem
• An introduction to timetabling
• Assigning students to course sections using tabu search
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• On Edge Coloring Bipartite Graphs
• Timetable construction: the algorithms and complexity perspective
• When Is the Classroom Assignment Problem Hard?

Cited in

(6)

• Optimal student sectioning on mandatory courses with various sections numbers
• 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
• The multiphase course timetabling problem
• scientific article; zbMATH DE number 1728530 (Why is no real title available?)
• Algorithm and theorem on student activity problems

This page was built for publication: A complexity analysis and an algorithmic approach to student sectioning in existing timetables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q310342)