The Round Robin algorithm is a CPU scheduling algorithm that is designed especially for time sharing systems. Each process is assigned a slice of time called time quantum to execute. To increase the performance of a Round Robin algorithm, it is important to choose an optimal time quantum. Many algorithms developed the Round Robin algorithm. This paper provides an algorithm that improves the performance of these algorithms and develops a time quantum that achieves stability in terms of the average waiting time and the average turnaround time. General TermsScheduling algorithms, Round Robin algorithms.