Comprehensive approach to student sectioning

7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008

Volumn , Issue , 2008, Pages

  Müller, Tomáš ^a   Murray, Keith ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

COURSE STRUCTURE; COURSE TIMETABLING;

STUDENTS;

EID: 84883106696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Mahmood Amintoosi and Javad Haddadnia. Feature selection in a fuzzy student sectioning algorithm. In Edmund Burke and Michael Trick, editors, Practice And Theory of Automated Timetabling, Selected Revised Papers, pages 147–160. Springer-Verlag LNCS 3616, 2005.
2. Don Banks, Peter van Beek, and Amnon Meisels. A heuristic incremental modeling approach to course timetabling. In Canadian Conference on AI, pages 16–29, 1998.
3. Russell Bent and Pascal Van Hentenryck. Online stochastic optimization without distributions. In ICAPS 2005. Monterey, CA, 2005.
4. Vincent A. Busam. An algorithm for class scheduling with section preference. Communications of the ACM, 10(9):567–569, 1967.
5. Michael W. Carter. A comprehensive course timetabling and student scheduling system at the University of Waterloo. In Edmund Burke and Wilhelm Erben, editors, Practice and Theory of Automated Timetabling III, pages 64–82. Springer-Verlag LNCS 2079, 2001.
6. Michael W. Carter and Gilbert Laporte. Recent developments in practical course timetabling. In Edmund Burke and Michael Carter, editors, Practice and Theory of Automated Timetabling II, pages 3–19. Springer-Verlag LNCS 1408, 1998.
7. R. Feldman and M. C. Golumbic. Optimization algorithms for student scheduling via constraint satisfiability. The Computer Journal, 33(4):356–364, 1990.
8. Alain Hertz and Vincent Robert. Constructing a course schedule by solving a series of assignment type problems. European Journal of Operational Research, 108(3):585–603, 1998.
9. Aubin J and J.A. Ferland. A large scale timetabling problem. Computers and Operations Research, 16(1):67–77, 1989.
10. Gilbert Laporte and Sylvain Desroches. The problem of assigning students to courses in a large engineering school. Computers and Operations Research, 13(4):387–394, 1986.
11. Tomáš Müller. Constraint solver library. GNU Lesser General Public License, SourceForge.net. Available at http://cpsolver.sf.net.
12. Tomáš Müller. Constraint-based Timetabling. PhD thesis, Charles University in Prague, Faculty of Mathematics and Physics, 2005.
13. Tomáš Müller, Roman Barták, and Hana Rudová. Conflict-based statistics. In J. Gottlieb, D. Landa Silva, N. Musliu, and E. Soubeiga, editors, EU/ME Workshop on Design and Evaluation of Advanced Hybrid Meta-Heuristics. University of Nottingham, 2004.
14. Keith Murray, Tomáš Müller, and Hana Rudová. Modeling and solution of a complex university course timetabling problem. In Edmund Burke and Hana Rudová, editors, Practice And Theory of Automated Timetabling, Selected Revised Papers, pages 189–209. Springer-Verlag LNCS 3867, 2007.
15. G. C. W. Sabin and G. K. Winter. The impact of automated timetabling on universities-a case study. Journal of the Operational Research Society, 37(7):689–693, 1986.
16. Scott E. Sampson and Elliott N. Weiss. Increasing service levels in conference and educational scheduling: A heuristic approach. Management Science, 41(11):1816–1825, 1995.
17. Andrea Schaerf. A survey of automated timetabling. Articifial Intelligence Review, 13(2):87–127, 1999.
18. H. Rudová T. Müller, R. Barták. Minimal perturbation problem in course timetabling. In Edmund Burke and Michael Trick, editors, Practice And Theory of Automated Timetabling, Selected Revised Papers, pages 126–146. Springer-Verlag LNCS 3616, 2005.