Examination scheduling is an optimization problem with constraints, a scheduling problem is one of the NP-hard problems, there is no algorithm that can solve them in polynomial time. Genetic algorithm is an algorithm for finding approximate optimal test of the global optimization problems. Application of genetic algorithms on the specific problem is not trivial
encoding the solution of the problem, identifying the mutation and crossover operator and fitness function of the solutions of the specific problem. In this paper, the authors have developed a way of encoding the solutions of examination scheduling in order to apply genetic algorithm.