Consider a set of n tasks with known runtimes r1,r2,.....rn to be run on a uniprocessor machine. which of the following processor scheduling algorithms will result in the maximum throughput?
1
Round - robin
2
Shortest job first
3
FCFS
4
Priority scheduling