A Modified Cross Over Genetic Algorithm Approach To Single Processor Scheduling Problem

There are numerous approach to scheduling problems. Scheduling problem is a NP hard problem. This paper present the modifiedcross over genetic algorithm approach to single processor process scheduling. Single processor machine efficiency depends upon the efficientscheduling of single processor. The work present in this paper shows that processor scheduling can be optimize by apply efficient schedulingalgorithm. Extensive computational experiments are carried out to get optimum efficiency of the proposed algorithm. Efficiency of thescheduling algorithm can be examined on number of factors. In this paper we consider average waiting time, turn around time and weighted turnaround time as an optimization criteria of scheduling algorithms. Simulation in this paper evaluates the performance and efficiency of proposedalgorithm. Experimental results indicates that MCOGA shoes better results than that of traditional scheduling algorithms