In Round Robin if Time quantum is less, More number of processes are present and All processes burst times are high than TQ then throughput decreases because all processes execute for TQ and wait in queue
In HRRN It favors shorter jobs but limit waiting time of longer processes
In FIFO if longer jobs arrived first then its Throughput decreases
In SJF smaller processes will execute first, it cause starvation of longer processes but compared to other scheduling algorithms SJF results maximum throughput.
So Answer is SJF