References
[1]. Barham,A,M. and Westwood,J.B.,[1978] A Simple
Heuristic to Facilitate Course Timetabling, Journal of the operational research society.
[2]. Burke, EK., and NewaII,J.R,A [1999], Multistage
Evolutionary Algorithm for Timetable Problem, IEEE
Transactions on Evolutionary Computation, Vol.3, No. 1,
pp. 63-74.
[3]. De Werra, D.[1985], An Introduction to Timetabling,
European Journal of Operational Research, pp. 151-162.
[4]. Glover, F. [1989], Tabu Search, Part 1, ORSA Journal on
Computing, 1, pp. 190-206.
[5]. Karp, R.M.[1972], Reducibility among Combinatorial
Problems in Complexity of Computer Computations
[6]. Le Kong, Schoenberg, G.H ,V. ,and
White,G.M,[1991],Complete University Timetabling using
Logic, ComputerEduc. Vol. 17, No. 2, pp. 145-153.
[7]. White,G.M.and Zhang,J [1998].,Generatlng Complete
University Timetables by Combining Tabu Search with
Constraint Logic, Lecture Notes in Computer Science,VoI.
1408.
[8]. WiHemen, R.J [2002], School Timetable Construction .'
Algorithms and Complexity, Ph.D. Thesis, Technische
Universiteit Eindhoven, 2002.