Definition :
Shortest job first is a scheduling algorithm within which the method with the tiniest execution time is chosen for execution next. Shortest job first is either preemptive or non-preemptive. owing to its easy nature, shortest job first is considered optimal. It additionally reduces the average waiting time for alternative processes awaiting execution.
Click here to get such more insights
Further Reading:
Product Development Flow by Donald G Reinertsen.