Penerapan algoritma Shortest Job First ( SJF) dan Priority Scheduling (PS) Pada Maintanance Mesin ATM
Abstract
In the banking world there are scheduling problems and is one of the important aspects for the smooth operation of the company, especially in the ATM (automatic teller machine). There is no initial system in scheduling repairs and charging money a cash machine so it is necessary to run the company's operations well. In this study wanted to propose a scheduling system that uses two algorithms that can be used as a comparison in scheduling. Algorithms that can be implemented in a queue system, one of which is SJF (Shortest Job First) and Priority Scheduling. The existence of applications with this system, users can know the schedule of preventive maintenance so as to facilitate the division of operation maintenance in the company in carrying out their respective duties.
Key Words: ATM(automatic teller machine), Shortest Job First, Priority Scheduling
Full Text:
PDFReferences
Avrizal, R., Kurnianda, N. R., Informatika, F., & Komputer, F. I. (2019). Optimalisasi Antrian Dengan Menggunakan Penggabungan Pr Dan Sjf ( Studi Kasus : Katering Saung Umi ). Jurnal Format.8(1). 1–8.
Binarso, Y. A., Sarwoko, E. A., & Bahtiar, N. (2017). Pembangunan Sistem Informasi Alumni Berbasis Web Pada Program Studi Teknik Informatika Universitas Diponegoro. Journal OfInformatics And Technology.1(1). 72–84.
Santika, M., & Hansun, S. (2014). Implementasi Algoritma Shortest Job First Dan Round Robin Pada Sistem Penjadwalan Pengiriman Barang. Jurnal Ultimatics.6(2). 94–99.
Sari, N. K., Soepardi, A., Industri, J. T., Pembangunan, U., & Veteran, N. (2018). Penjadwalan Kegiatan Pemeliharaan Untuk Memaksimalkan Availabilitas Mesin. 105–111.
Sugiarti, Y., & Fitriani, N. (2015). Studi Kasus : Rumah Sakit Ibu Dan Anak Buah Hati Ciputat. Jurnal Sistem Informasi.8(2). 1–11.
DOI: http://dx.doi.org/10.30829/algoritma.v7i1.15377
Refbacks
- There are currently no refbacks.
Indexing:
|
Algoritma: Jurnal Ilmu Komputer dan Informatika
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.