A University Timetabling Problem (UTP) belongs to NP-complete (Nondeterministic Polynomial-Complete) problem category since it has huge search space that consists of many students, classrooms, lectures, and courses permutation. Due to that, finding an optimal schedule using exact algorithm is impossible to be done under a reasonable time. Harmony Search is a heuristic method that can solve NP-Complete problem such as UTP in reasonable time. However because of its heuristic nature, it can only provide solution which is close to the perfect solution. Therefore, to prove that a schedule is a feasible solution, several constraints have to be satisfied. This research used Harmony Search to solve the UTP whereby the dataset, constraints, and experiments are acquired and performed in STMIK Mikroskil. This research also evaluates the speed performance and fitness value of Harmony Search using different parameter configuration. From its finding, the HMCR parameter value that is best suited for scheduling is in range of 0.7 to 0.95. The PAR value however, did not sufficiently contribute to the speed and fitness value.