Scheduling plays an essential role in multitasking, multiprocessing, and real-time operating systems. The major objective of scheduling is to enhance system performance. Various pre-emptive and non-preemptive scheduling techniques have been developed; however, often contradictory results have left designer skeptical about the efficacy of techniques and there exists no clear consensus about the robustness of the scheduling technique. Round robin is considered as the most widely adopted algorithm having advantages that include fairness and simplicity, but constant time quantum may result in worst turnaround time and waiting time. In this research work, a round robin based scheduling scheme named randomized dynamic quantum (RDQ) CPU scheduling algorithm has been proposed that is based on the idea of using randomly generated dynamic time quantum. Simulation results indicate that RDQ improves turnaround time and waiting time as compared to existing schemes.