Results 1 to 1 of 1
There are n jobs in the queue, and each job need time Ti, where 1 ≤ i ≤ n, to finish. Assume we use shortest job first scheduling without preemption. ...
Enjoy an ad free experience by logging in. Not a member yet? Register.
- 09-30-2013 #1
- Join Date
- Sep 2013
shortest job first non preemptive formula
to finish. Assume we use shortest job first scheduling without preemption.
What is the average turnaround time? Please give a formula and simplified
and fixed the formula using sigma