Harmony great deluge for solving curriculum based course timetabling problem

University course timetabling which has been determined as non deterministic polynomial problem that accept widely as problem that are intractable. An efficient algorithm does not exist that is guaranteed to find an optimal solution for such problems. The design of good algorithm to find new methods and techniques to solve such problem is a very active area of research. This paper presents the adaption of the hybridizing between harmony search with great deluge algorithm for solving curriculum-based course timetabling problems. The algorithm can be adapted to the problem. Results were not comparatively better than those previously known as best solution. Proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.