Abstract. In this paper, we investigate variable neighbourhood search (VNS) approaches for the university examination timetabling problem. In addition to a basic VNS method, we introduce variants of the technique with different initialisation methods including a biased VNS and its hybridisation with a Genetic Algorithm. A number of different neighbourhood structures are analysed. It is demonstrated that the proposed technique is able to produce high quality solutions across a wide range of benchmark problem instances. In particular, we demonstrate that the Genetic Algorithm, which intelligently selects approporiate neighbourhoods to use within the biased VNS produces the best known results in the literature, in terms of solution quality, on some of the the benchmark instances, although it requires relatively large amount of computational time. Possible extensions to this overall approach are also discussed.