One of the most well-known constraint problem is a university course timetabling problem (UCTP), which become more difficult and more complex specially when we have a course with more than one teacher or a teacher with more than one course. This constraint problem take a lot of times to construct. In this paper we solve hard and soft constraint and take less time than usual by used one of artificial techniques, branch of swarm intelligent (SI), called particle swarm optimization (PSO). After a lot of researches we find that UTP can be solved with less time and more efficient based on PSO than other artificial intelligent (AI), or SI. In this paper, some improvements has been added to the algorithm to fit with the existing parameters in a