Annals of Operations Research

, Volume 181, Issue 1, pp 249–269 | Cite as

Comprehensive approach to student sectioning

Article

Abstract

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.

Keywords

Student sectioning Student scheduling University timetabling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. Aubin, J., & Ferland, J. (1989). A large scale timetabling problem. Computers and Operations Research, 16(1), 67–77. CrossRefGoogle Scholar
  3. 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
  4. Bent, R., & Van Hentenryck, P. (2005). Online stochastic optimization without distributions. In ICAPS 2005, Monterey, CA, 2005. Google Scholar
  5. Busam, V. A. (1967). An algorithm for class scheduling with section preference. Communications of the ACM, 10(9), 567–569. CrossRefGoogle Scholar
  6. Carter, M. W. (2001). A comprehensive course timetabling and student scheduling system at the University of Waterloo. In E. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol. 2079. Practice and theory of automated timetabling III (pp. 64–82). Berlin: Springer. CrossRefGoogle Scholar
  7. Carter, Michael W., & Laporte, G. (1998). Recent developments in practical course timetabling. In E. Burke & M. Carter (Eds.), Lecture notes in computer science : Vol. 1408. Practice and theory of automated timetabling II (pp. 3–19). Berlin: Springer. CrossRefGoogle Scholar
  8. Feldman, R., & Golumbic, M. C. (1990). Optimization algorithms for student scheduling via constraint satisfiability. The Computer Journal, 33(4), 356–364. CrossRefGoogle Scholar
  9. Hertz, A., & Robert, V. (1998). Constructing a course schedule by solving a series of assignment type problems. European Journal of Operational Research, 108(3), 585–603. CrossRefGoogle Scholar
  10. Laporte, G., & Desroches, S. (1986). The problem of assigning students to courses in a large engineering school. Computers and Operations Research, 13(4), 387–394. CrossRefGoogle Scholar
  11. Müller, T. (2005). Constraint-based timetabling. PhD thesis, Charles University in Prague, Faculty of Mathematics and Physics. Google Scholar
  12. Müller, T. (2010). Constraint solver library. GNU Lesser General Public License, SourceForge.net. Available at http://cpsolver.sf.net.
  13. 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
  14. 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
  15. 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
  16. 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
  17. Sampson, S. E., & Weiss, E. N. (1995). Increasing service levels in conference and educational scheduling: a heuristic approach. Management Science, 41(11), 1816–1825. CrossRefGoogle Scholar
  18. Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87–127. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Purdue UniversityWest LafayetteUSA

Personalised recommendations