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

DOI10.1007/s10951-015-0424-2zbMath1347.90039OpenAlexW1964930428MaRDI QIDQ310342

Mohammad Hasan, M. Dambrine

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)

Related Items (4)

A complexity analysis and an algorithmic approach to student sectioning in existing timetables ⋮ Optimal student sectioning on mandatory courses with various sections numbers ⋮ Decomposition of university course timetabling. A systematic study of subproblems and their complexities ⋮ The multiphase course timetabling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complexity analysis and an algorithmic approach to student sectioning in existing timetables
• Timetable construction: the algorithms and complexity perspective
• An introduction to timetabling
• A large scale timetabling problem
• Assigning students to course sections using tabu search
• A data structure for dynamic trees
• On Edge Coloring Bipartite Graphs
• When Is the Classroom Assignment Problem Hard?
• Bipartite Edge Coloring in $O(\Delta m)$ Time

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