Shortest Job First is a CPU scheduling algorithm where the process with the shortest burst time is selected next. Once a process starts execution, it cannot be interrupted until it finishes. It minimizes average waiting and turnaround time, making it highly efficient. However, it requires prior knowledge of burst times and may lead to starvation of longer processes. It is suitable for batch systems with predictable job lengths but not ideal for interactive systems.