Round-robin scheduling is a CPU scheduling algorithm that assigns each process a fixed time slice in a cyclic order. It ensures fairness by giving all processes regular CPU access. Performance depends on the chosen time slice length. Example: Desktop operating systems using round-robin scheduling for user applications.
