Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Jurnal ULTIMATICS
Monica Santika
Universitas Multimedia Nusantara
Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Implementasi Algoritma Shortest Job First dan Round Robin pada Sistem Penjadwalan Pengiriman Barang Monica Santika; Seng Hansun
Ultimatics : Jurnal Teknik Informatika Vol 6 No 2 (2014): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (976.864 KB) | DOI: 10.31937/ti.v6i2.336

Abstract

Delivery of goods will normally be conducted in accordance with the queuing time of booking. Sometimes, it is inefficient and results in a delay on the delivery of goods. Therefore, to make a better scheduling system, the Shortest Job First and Round Robin algorithms been implemented. From the results of experiments, Shortest Job First and Round Robin algorithms successfully applied to the scheduling delivery application. Shortest Job First algorithm is better than Round Robin scheduling in the case of delivery of goods, because the algorithm execution process which takes small time will be moved before the process which takes much time, so it needs smaller time than using Round Robin algorithm. Index Terms - Round Robin, Scheduling, Shipping, Shortest Job First
Co-Authors Seng Hansun