First Come First Served (FCFS) is the simplest and non-preemptive scheduling algorithm. The process is allocated to the CPU in the order of arrival.
Shortest Job First (SJF) selects the process with the smallest execution time. It reduces average waiting time.
Round Robin (RR) assigns a fixed time unit per process and cycles through them. It is simple and fair.
Priority Scheduling assigns the CPU to the process with the highest priority. Lower priority processes wait.