Comprehensive approach to student sectioning
- 205 Downloads
Student sectioning is the problem of assigning students to particular sections of courses they request while respecting constraints such as course structures, section limits, and reserved spaces. Students may also provide preferences on class times and course alternatives. In this paper, three approaches to this problem are examined and combined in order to tackle it on a practical level: student sectioning during course timetabling, batch sectioning after a complete timetable is developed, and online sectioning for making additional changes to student schedules. An application and some practical results of the proposed solutions based on actual data are also included.
KeywordsStudent sectioning Student scheduling University timetabling
Unable to display preview. Download preview PDF.
- Amintoosi, M., & Haddadnia, J. (2005). Feature selection in a fuzzy student sectioning algorithm. In E. Burke & M. Trick (Eds.), Lecture notes in computer science : Vol. 3616. Practice and theory of automated timetabling, selected revised papers (pp. 147–160). Berlin: Springer. Google Scholar
- Banks, D., van Beek, P., & Meisels, A. (1998). A heuristic incremental modeling approach to course timetabling. In Canadian conference on AI (pp. 16–29). Google Scholar
- Bent, R., & Van Hentenryck, P. (2005). Online stochastic optimization without distributions. In ICAPS 2005, Monterey, CA, 2005. Google Scholar
- Müller, T. (2005). Constraint-based timetabling. PhD thesis, Charles University in Prague, Faculty of Mathematics and Physics. Google Scholar
- Müller, T. (2010). Constraint solver library. GNU Lesser General Public License, SourceForge.net. Available at http://cpsolver.sf.net.
- Müller, T., Barták, R., & Rudová, H. (2004). Conflict-based statistics. In J. Gottlieb, D. Landa Silva, N. Musliu, & E. Soubeiga (Eds.), EU/ME workshop on design and evaluation of advanced hybrid meta-heuristics. University of Nottingham: Nottingham. Google Scholar
- Murray, K., Müller, T., & Rudová, H. (2007). Modeling and solution of a complex university course timetabling problem. In E. Burke & H. Rudová (Eds.), Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling, selected revised papers (pp. 189–209). Berlin: Springer. CrossRefGoogle Scholar
- Rudová, H., Müller, T., & Barták, R. (2005). Minimal perturbation problem in course timetabling. In E. Burke & M. Trick (Eds.), Lecture notes in computer science : Vol. 3616. Practice and theory of automated timetabling, selected revised papers (pp. 126–146). Berlin: Springer. Google Scholar
- Sabin, G. C. W., & Winter, G. K. (1986). The impact of automated timetabling on universities a case study. Journal of the Operational Research Society, 37(7), 689–693. Google Scholar