1[1]Garey M R,Johnson D S.Compute and Intractability: A Guide to the theory of NP completeness [M].San francisco:W.H, Freeman Co.,1979.
2[2]Chu P C,Beasley J E.A genetic algorithm for the generalized assignment problem [J].European Journal of Operational Research,1995.
3[3]Safaai D,Sigeru O.Incorporating constraint propagation in genetic algorithm for university timetable planning [J].Engineering Applications of Artificial Intelligence,1999, 241～253.
4[4]Luan F,Yao X.Solving real-world lecture room assignment problems by genetic algorithms,Complexity International [J].An Electronic Journal of Complex System Research,1996(3).
5[5]Colorni A,Dorigo marco,Maniezzo V.Metaheuristics for high school timetabling [J]Computational Optimization and Applications,1998,(9):275～298.
