Job-scheduling-shortest-remaining-time-first.py

n = int(input('Enter no of processes: '))
bt = [0] * (n + 1)
at = [0] * (n + 1)
abt = [0] * (n + 1)
for i in range(n):
	abt[i] = int(input('Enter the burst time for process {} : '.format(i + 1)))
	at[i] = int(input('Enter the arrival time for process {} : '.format(i + 1))) 
	bt[i] = [abt[i], at[i], i]

#bt = [[7, 0, 7, 0], [5, 1, 5, 1], [3, 2, 3, 2], [1, 3, 1, 3], [2, 4, 2, 4], [1, 5, 1, 5]]
#at = [0, 1, 2, 3, 4, 5]
bt.pop(-1)
print(abt)
print(bt)
sumbt = 0 
i = 0
ll = []
for i in range(0, sum(abt)):
	l = [j for j in bt  if j[1] <= i]
	l.sort(key=lambda x: x[0])
	print(l, l[0][2])
	bt[bt.index(l[0])][0] -= 1
	for k in bt:
		if k[0] == 0:
			t = bt.pop(bt.index(k))
			ll.append([k, i + 1])
print(ll)
ct = [0] * (n + 1)
tat = [0] * (n + 1)
wt = [0] * (n + 1)
for i in ll:
	print(i, i[0], i[1], i[0][2])
	ct[i[0][2]] = i[1] 
	#abt[i[0][3]] = i[0][2]

for i in range(len(ct)):
	tat[i] = ct[i] - at[i]
	wt[i] = tat[i] - abt[i]
ct.pop(-1)
wt.pop(-1)
tat.pop(-1)
abt.pop(-1)
at.pop(-1)
print('BT\tAT\tCT\tTAT\tWT')
for i in range(len(ct)):
	print("{}\t{}\t{}\t{}\t{}\n".format(abt[i], at[i], ct[i], tat[i], wt[i]))
print('Average Waiting Time = ', sum(wt)/len(wt))
print('Average Turnaround Time = ', sum(tat)/len(tat))