A round-robin scheduling algorithm is used to schedule the process fairly for each job a time slot or quantum and the interrupting the job if it is not completed by then the job come after the other job which is arrived in the quantum time that makes these scheduling fairly.

Characteristics of Round Robin Scheduling :

It’s simple, easy to use, and starvation-free as all processes get the balanced CPU allocation.
One of the most widely used methods in CPU scheduling as a core.
It is considered preemptive as the processes are given to the CPU for a very limited time.

Advantages of Round Robin Scheduling :

Round robin seems to be fair as every process gets an equal share of CPU.
The newly created process is added to the end of the ready queue.

Disadvantages of Round Robin Scheduling :

Throughput depends on quantum time.
If the time quantum is too large RR degrades to FCFS.
If we want to give some process priority, we cannot.