Round Robin is An algorithm uses time slices (also known as time quanta) are assigned to each process in equal portions and in circular order, handling all processes without priority.
Shortest Job First a non-preemptive discipline in which waiting job with the smallest estimated run-time-to-completion is run next.
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
Please make sure to update tests as appropriate.