PSO was applied towards solving course timetabling problem in this work. To reduce the computational complexity, a time slot was designated in a particle's encoding as the scheduling unit. Two type of pso, the inertia weight version and constriction version, were evaluated. Moreover an interchange heuristic was utilized to explore the neighboring solution space to improve solution quality. Additionally, schedule conflicts are handled after a solution has been generated. Experiments result demonstrate that the proposed scheme of constriction pso with interchange heuristic is able to generate satisfactory course timetables that meet the requires of teachers and classes according to the various applied constraints.