diff --git a/DIRECTORY.md b/DIRECTORY.md
index f93f082d8..34ee376be 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -591,7 +591,8 @@
 
 ## Scheduling
   * [First Come First Served](https://github.com/TheAlgorithms/Python/blob/master/scheduling/first_come_first_served.py)
-  * [Shortest Job First Algorithm](https://github.com/TheAlgorithms/Python/blob/master/scheduling/shortest_job_first_algorithm.py)
+  * [Round Robin](https://github.com/TheAlgorithms/Python/blob/master/scheduling/round_robin.py)
+  * [Shortest Job First](https://github.com/TheAlgorithms/Python/blob/master/scheduling/shortest_job_first.py)
 
 ## Searches
   * [Binary Search](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py)
diff --git a/scheduling/round_robin.py b/scheduling/round_robin.py
index 10aa3ecab..4a79301c1 100755
--- a/scheduling/round_robin.py
+++ b/scheduling/round_robin.py
@@ -23,7 +23,7 @@ def calculate_waiting_times(burst_times: List[int]) -> List[int]:
     rem_burst_times = list(burst_times)
     waiting_times = [0] * len(burst_times)
     t = 0
-    while 1:
+    while True:
         done = True
         for i, burst_time in enumerate(burst_times):
             if rem_burst_times[i] > 0:
@@ -33,7 +33,7 @@ def calculate_waiting_times(burst_times: List[int]) -> List[int]:
                     rem_burst_times[i] -= quantum
                 else:
                     t += rem_burst_times[i]
-                    waiting_times[i] = t - burst_times[i]
+                    waiting_times[i] = t - burst_time
                     rem_burst_times[i] = 0
         if done is True:
             return waiting_times
diff --git a/scheduling/shortest_job_first_algorithm.py b/scheduling/shortest_job_first.py
similarity index 100%
rename from scheduling/shortest_job_first_algorithm.py
rename to scheduling/shortest_job_first.py