Comparison Analysis of Round Robin Algorithm with Highest Response Ratio Next Algorithm for Job Scheduling Problems

Benny Richardson, Wirawan Istiono


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

Full Text:



S. Kavitha, P. Venkumar, N. Rajini, and P. Pitchipoo, “An Efficient Social Spider Optimization for Flexible Job Shop Scheduling Problem,” Journal of Advanced Manufacturing Systems, vol. 17, no. 2, pp. 181–196, 2018.

D. D. Sinaga and S. Hansun, “Indonesian text document similarity detection system using rabin-karp and confix-stripping algorithms,” International Journal of Innovative Computing, Information and Control, vol. 14, no. 5, pp. 1893–1903, 2018.

Y. Habibi, G. Swalaganata, and A. D. Yustita, “Penyelesaian Multi-Objective Flexible Job Shop Scheduling Problem Menggunakan Hybrid Algoritma Imun,” Jurnal Teknosains, vol. 6, no. 2, p. 79, 2017.

S. A. Shukor, I. M. Shaheed, and S. Abdullah, “Population initialisation methods for fuzzy job-shop scheduling problems: Issues and future trends,” International Journal on Advanced Science, Engineering and Information Technology, vol. 8, no. 4–2, pp. 1820–1828, 2018.

J. Zhang, G. Ding, Y. Zou, S. Qin, and J. Fu, “Review of job shop scheduling research and its new perspectives under Industry 4.0,” Journal of Intelligent Manufacturing, vol. 30, no. 4, pp. 1809–1830, 2019.

J. Alzahrani, “Job-Shop Scheduling Optimization With Stochastic Processing Times,” International Journal of Engineering Technologies and Management Research, vol. 6, no. 1, pp. 73–83, 2020.

T. Hidayat, Y. Azzery, and R. Mahardiko, “Load Balancing Network by using Round Robin Algorithm: A Systematic Literature Review,” Jurnal Online Informatika, vol. 4, no. 2, p. 85, 2020.

Awang and F. Badri, “Dual Load balancing menggunakan Algoritma Round-robin pada Cloud Computing,” Applied Technology and Computing Science Journal, vol. 2, no. 2, pp. 70–78, 2020.

C. KOMALASARI and W. ISTIONO, “A Comparative Study of Cocktail Sort and Insertion Sort,” Journal of Applied Computer Science & Mathematics, vol. 15, no. 1, pp. 21–25, 2021.

S. Ul Sabha, “A Novel and Efficient Round Robin Algorithm with Intelligent Time Slice and Shortest Remaining Time First,” Materials Today: Proceedings, vol. 5, no. 5, pp. 12009–12015, 2018.

G. P. Arya, K. Nilay, and D. Prasad, “An improved round robin CPU scheduling algorithm based on priority of process,” International Journal of Engineering and Technology(UAE), vol. 7, no. 4, pp. 238–241, 2018.

A. Joshi, “A Modified Version of Round Robin Algorithm ‘ Modulo Based Round Robin Algorithm ,’” International Journal of Advanced Science and Technology, vol. 29, no. 11, pp. 576–578, 2020.

S. Zouaoui, L. Boussaid, and A. Mtibaa, “Improved time quantum length estimation for round robin scheduling algorithm using neural network,” Indonesian Journal of Electrical Engineering and Informatics, vol. 7, no. 2, pp. 190–194, 2019.

A. Fiad, Z. M. Maaza, and H. Bendoukha, “Improved version of round robin scheduling algorithm based on analytic model,” International Journal of Networked and Distributed Computing, vol. 8, no. 4, pp. 195–202, 2020.

R. K. Sanodiya, S. Sharma, V. Sharma, R. Gandhi, P. Vishwavidyalaya, and B. M. P -India, “A Highest Response Ratio Next(HRRN) Algorithm Based Load Balancing Policy For Cloud Computing,” International Journal of Computer Science Trends and Technology, vol. 3, no. 1, pp. 72–76, 2013.

S. Raheja, R. Dhadich, and S. Rajpal, “Vague Oriented Highest Response Ratio Next (VHRRN) scheduling algorithm,” IEEE International Conference on Fuzzy Systems, 2013.

R. Latip and Z. Idris, “Highest Response Ratio Next (HRRN) vs First Come First Served (FCFS) scheduling algorithm in grid environment,” Communications in Computer and Information Science, vol. 180 CCIS, no. PART 2, pp. 688–693, 2011.

P. S. Varma, “Design of Modified HRRN Scheduling Algorithm for priority systems Using Hybrid Priority scheme,” Journal of Telematics and Informatics, vol. 1, no. 1, 2013.

G. A. Shidali, S. B. Junaidu, and S. E. Abdullahi, “Weighted Pre-Emptive Modified Highest Response Ratio Next,” Computer Science and Engineering, vol. 5, no. 3, pp. 59–65, 2015.


  • There are currently no refbacks.

Abava  Кибербезопасность MoNeTec 2024

ISSN: 2307-8162