Implementasi Algoritma Shortest Job First dan Round Robin pada Sistem Penjadwalan Pengiriman Barang

  • Santika M
  • Hansun S
N/ACitations
Citations of this article
80Readers
Mendeley users who have this article in their library.

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

Cite

CITATION STYLE

APA

Santika, M., & Hansun, S. (2014). Implementasi Algoritma Shortest Job First dan Round Robin pada Sistem Penjadwalan Pengiriman Barang. Ultimatics : Jurnal Teknik Informatika, 6(2), 94–99. https://doi.org/10.31937/ti.v6i2.336

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free