Abstract
The university Examination Timetabling Problem is one of the most important scheduling problems that numerous educational organizations have to find out a solution to manage their examinations by assigning these events to particular timeslots, rooms and/or invigilators. This problem is NP-complete due to the number of conflicting constraints that must be considered in the resolution. Particle Swarm Optimization (PSO) technique is a common intelligent method that has been successfully applied to many hard combinatorial optimization problems. The purpose of this paper is to expose a number of articles that appeared this last decade and used the PSO technique to solve the University examination timetabling problem. The overall techniques are described, focusing on the particle representation and updating. This research also offers insight into how well the PSO algorithm performs compared with other algorithms used to solve the same problem and datasets. Finally, a summary of the described algorithms and their most distinguishing features is presented in addition to future research directions.