Resumen
Job Scheduling is the process of allocating operating system resources to do several different jobs. The problem that arises is how to manage the work of the system to complete a lot of existing work in a timely and optimal time. To solve the problem, several heuristics and metaheuristics are used. The goal is to minimize the total time that all work has been executed. In this paper, the researcher will compare the Round Robin algorithm and the Highest Response Ratio Next algorithm to find which algorithm is the most optimal for completing all work on time. In this research, a comparison test was conducted with three cases, and judging from the 3 cases that have been compared between the Round Robin algorithm and High Response Ratio Next, it was found that the High Response Ratio Next algorithm is more optimal than the process carried out using the Round Robin algorithm. Due to the waiting time for each process that is run by the CPU, the High Response Ratio Next algorithm is less than the waiting time in the Round Robin algorithm