The automated timetabling and scheduling is one of the hardest problem areas. This is because of constraints and satisfying those constraints to get the feasible and optimized schedule, and it is already proved as an NP Complete (1) [1]. The basic idea behind this study is to investigate the performance of Genetic Algorithm on general scheduling problem under predefined constraints and check the validity of results, and then having comparative analysis with other available approaches like Tabu search, simulated annealing, direct and indirect heuristics [2] and expert system. It is observed that Genetic Algorithm is good solution technique for solving such problems and later analysis will prove this argument. The program is written in C++ and analysis is done by using variation in various parameters.