Shortest Job Next (SJN) Scheduling is a non-preemptive scheduling algorithm that selects the process with the shortest execution time to execute next, minimizing the average waiting time for processes. However, it can lead to the 'starvation' problem for longer processes if shorter processes continuously arrive, delaying the execution of longer tasks indefinitely.