Round Robin is a preemptive scheduling algorithm where each process is assigned a fixed time quantum (or time slice) to execute. If a process completes within the time quantum, it moves to the end of the execution queue. This algorithm ensures fairness but can suffer from poor performance when the time quantum is too large.