International Journal of Engineering and Technology

Many Research have be done for Process scheduling Problem. Most of the time parameters of the Scheduling problem have changed but the problem remain same as to find out the optimal schedule which can optimize the problem under consideration. Implementation of genetic algorithm for operating system process scheduling is a new idea . Genetic Algorithm is a robust technique for solve process scheduling and optimization problem. The performance of any genetic algorithm is depend on the operators used for the GA Simulation. In this paper we will analyse the performance of modified cross over genetic algorithm for operating system process scheduling problem. We take two operator of GA i.e. explorative operator and exploited operator. The performance of the genetic algorithm is greatly depends upon these two operator. As the probability of explorative and exploited operator is changed the convergence of Genetic algorithm is also changed.