The process is allocated to the CPU which has least burst
time. A scheduler arranges the processes with the least
burst time in head of the queue and longest burst time in
tail of the queue. This requires advanced knowledge or
estimations about the time required for a process to
complete [2]. This algorithm is designed for maximum
throughput in most scenarios.