Santika, Monica and Hansun, Seng (2014) Implementasi Algoritma Shortest Job First dan Round Robin pada Sistem Penjadwalan Pengiriman Barang. Ultimatics : Jurnal Teknik Informatika, 6 (2). ISSN 2085-4552
Full text not available from this repository.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.
| Item Type: | Article |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming 600 Technology (Applied Sciences) > 650 Management and Public Relations > 658 General management (Risk Management, Profit and Loss, Logistics) |
| Divisions: | Faculty of Engineering & Informatics > Informatics |
| Depositing User: | Administrator UMN Library |
| Date Deposited: | 19 Oct 2021 04:33 |
| Last Modified: | 19 Oct 2021 04:34 |
| URI: | https://kc.umn.ac.id/id/eprint/18856 |
Actions (login required)
 |
View Item |
