Preference-based assignment of university students to multiple teaching groups
暂无分享,去创建一个
[1] Gerhard J. Woeginger,et al. Timetabling problems at the TU Eindhoven , 2009, Eur. J. Oper. Res..
[2] Ben Paechter,et al. Finding Feasible Timetables Using Group-Based Operators , 2007, IEEE Transactions on Evolutionary Computation.
[3] Andreas Drexl,et al. Distribution requirements and compactness constraints in school timetabling , 1997 .
[4] Eddie Cheng,et al. Flow Formulations for the Student Scheduling Problem , 2002, PATAT.
[5] Gilbert Laporte,et al. The problem of assigning students to course sections in a large engineering school , 1986, Comput. Oper. Res..
[6] Edmund K. Burke,et al. The practice and theory of automated timetabling , 2014, Ann. Oper. Res..
[7] H. Peyton Young,et al. Equity - in theory and practice , 1994 .
[8] Martin Charles Golumbic,et al. Constraint Satisfiability Algorithms for Interactive Student Scheduling , 1989, IJCAI.
[9] Stefan Helber,et al. Application of a real-world university-course timetabling model solved by integer programming , 2007, OR Spectr..
[10] Sophia Daskalaki,et al. Efficient solutions for a university timetabling problem through integer programming , 2005, Eur. J. Oper. Res..
[11] Edmund K. Burke,et al. Automated University Timetabling: The State of the Art , 1997, Comput. J..
[12] D. de Werra,et al. An introduction to timetabling , 1985 .
[13] Andrea Schaerf,et al. A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] S. French. Decision Theory: An Introduction to the Mathematics of Rationality , 1986 .
[16] Gilbert Laporte,et al. Recent Developments in Practical Examination Timetabling , 1995, PATAT.