Comprehensive approach to student sectioning

被引:23
作者
Mueller, Tomas [1 ]
Murray, Keith [1 ]
机构
[1] Purdue Univ, W Lafayette, IN 47907 USA
关键词
Student sectioning; Student scheduling; University timetabling;
D O I
10.1007/s10479-010-0735-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:249 / 269
页数:21
相关论文
共 18 条
[1]  
Amintoosi M, 2005, LECT NOTES COMPUT SC, V3616, P147, DOI 10.1007/11593577_9
[2]  
[Anonymous], 2005, THESIS CHARLES U PRA
[3]   A LARGE-SCALE TIMETABLING PROBLEM [J].
AUBIN, J ;
FERLAND, JA .
COMPUTERS & OPERATIONS RESEARCH, 1989, 16 (01) :67-77
[4]  
Banks D., 1998, Advances in Artificial Intelligence. 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI'98. Proceedings, P16
[5]  
Bent R., 2005, ICAPS 2005 MONT CA
[6]   AN ALGORITHM FOR CLASS SCHEDULING WITH SECTION PREFERENCE [J].
BUSAM, VA .
COMMUNICATIONS OF THE ACM, 1967, 10 (09) :567-&
[7]  
Carter MW, 2001, LECT NOTES COMPUT SC, V2079, P64
[8]  
Carter MW, 1998, LECT NOTES COMPUT SC, V1408, P3, DOI 10.1007/BFb0055878
[9]   OPTIMIZATION ALGORITHMS FOR STUDENT SCHEDULING VIA CONSTRAINT SATISFIABILITY [J].
FELDMAN, R ;
GOLUMBIC, MC .
COMPUTER JOURNAL, 1990, 33 (04) :356-364
[10]   Constructing a course schedule by solving a series of assignment type problems [J].
Hertz, A ;
Robert, V .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 108 (03) :585-603