Shortest Job Next (SJN) is a scheduling algorithm that selects the process with the shortest expected execution time to run next, optimizing for minimal average waiting time. It is non-preemptive, meaning once a process starts executing, it runs to completion without interruption, which can lead to the 'convoy effect' if longer processes are delayed indefinitely.