Dynamic process scheduling using genetic algorithm
Qasim Mohammed Hussein, Armaneesa Naaman Hasoon · 2017
There is a necessity to schedule the system and user processes by the operating system to getting maximum utilization of the CPU and obtaining high throughput. This paper presents a dynamic scheduling algorithm that make use of genetic algorithm operations for scheduling multi non-preemptive task on uniprocessor system to get minimum average waiting time and average turnaround time. The algorithm depend on construct fitness function that take in its consideration the dead time of process to avoid the starvation problem, in addition to obtaining maximum throughput. The results from proposed algorithm simulation by matlab (8.3) illustrates the successful of this method to obtain optimal result by giving the minimum average turnaround time for executing the given processes.