SJF Scheduling Algorithm - Adi Paramartha - Python

sjf_adi.py

#ShortestJobFirst Scheduling Algorithms
#Pseudocode: Execute task with shortest burst time / processing time first

import random
import time

i=1

a = random.randrange(1, 10)
b = random.randrange(1, 10)
c = random.randrange(1, 10)
d = random.randrange(1, 10)
e = random.randrange(1, 10)

taskList = {'Task_1': a , 'Task_2': b, 'Task_3': c, 'Task_4': d, 'Task_5': e}

for w in sorted(taskList, key=taskList.get, reverse=False):
    print(w, " executed at ",i, " with load of ", taskList[w])
    i+=1