IMPLEMENTASI APLIKASI PEMAKAIAN MOBIL KANTOR DENGAN MENGGUNAKAN ALGORITMA PRIORITY SCHEDULING BERBASIS WEB PADA PT PLN (PERSERO) PUSAT ENJINIRING KETENAGALISTRIKAN

Cahyono, Dino (2023) IMPLEMENTASI APLIKASI PEMAKAIAN MOBIL KANTOR DENGAN MENGGUNAKAN ALGORITMA PRIORITY SCHEDULING BERBASIS WEB PADA PT PLN (PERSERO) PUSAT ENJINIRING KETENAGALISTRIKAN. S1 thesis, Universitas Mercu Buana - Menteng.

[img] Text (Cover)
41516120039-Dino Cahyono-01 Cover - DINO CAHYONO.pdf

Download (922kB)
[img] Text (Abstrak)
41516120039-Dino Cahyono-02 Abstrak - DINO CAHYONO.pdf
Restricted to Registered users only

Download (306kB)
[img] Text (Bab 1)
41516120039-Dino Cahyono-03 BAB I - DINO CAHYONO.pdf
Restricted to Registered users only

Download (300kB)
[img] Text (Bab 2)
41516120039-Dino Cahyono-04 BAB II - DINO CAHYONO.pdf
Restricted to Registered users only

Download (336kB)
[img] Text (Bab 3)
41516120039-Dino Cahyono-05 BAB III - DINO CAHYONO.pdf
Restricted to Registered users only

Download (246kB)
[img] Text (Bab 4)
41516120039-Dino Cahyono-06 BAB IV - DINO CAHYONO.pdf
Restricted to Registered users only

Download (672kB)
[img] Text (Bab 5)
41516120039-Dino Cahyono-07 BAB V - DINO CAHYONO.pdf
Restricted to Registered users only

Download (243kB)
[img] Text (Daftar Pustaka)
41516120039-Dino Cahyono-08 Daftar Pustaka - DINO CAHYONO.pdf
Restricted to Registered users only

Download (343kB)
[img] Text (Lampiran)
41516120039-Dino Cahyono-09 Lampiran - DINO CAHYONO.pdf
Restricted to Registered users only

Download (1MB)
[img] Other (Form pernyataan)
41516120039-Dino Cahyono-10 Scan Formulir Pernyataan Keabsahan dan Persetujuan Publikasi Tugas Akhir - DINO CAHYONO.PDF
Restricted to Registered users only

Download (151kB)

Abstract

Priority Scheduling merupakan algoritma penjadwalan berprioritas. Tiap – tiap proses dilengkapi dengan nomor prioritas (nilai integer terkecil biasanya merupakan prioritas terbesar). Pengerjaan mendahulukan proses yang memiliki prioritas terbesar. Jika beberapa proses memiliki prioritas yang sama, maka akan digunakan algoritma. First come first served scheduling (FCFS). Priority scheduling juga dapat dijalankan secara preemptive maupun non-preemptive. Pada preemptive, jika ada suatu proses yang baru datang memiliki prioritas yang lebih tinggi daripada proses yang sedang dijalankan, maka proses yang sedang berjalan tersebut dihentikan, lalu dialihkan untuk proses yang baru dating tersebut. Sementara itu, pada non-preemptive, proses yang baru datang tidak dapat mengganggu proses yang sedang berjalan, tetapi hanya diletakkan di depan queue, Dalam Penelitian ini, penulis menggunakan metode pengembangan software yaitu metode Extreme Programing. Extreme programming (XP) adalah metodologi dalam pengembangan agile software development methodologies yang berfokus pada pengkodean (coding) yang menjadi aktivitas utama dalam semua tahapan pada siklus pengembangan perangkat lunak. Algoritma priority scheduling berhasil diterapkan pada aplikasi pemakaian mobil. Hal ini terbukti dengan dihasilkannya urutan prioritas karyawan bedasarkan pada aturan prioritas yaitu jabatan pada aplikasi. Dengan adanya algoritma priority scheduling urutan antrian menjadi dinamis seiring masuknya permintaan disesuaikan dengan aturan prioritas yang di tetapkan. Hasil uji system baik dengan white box dan black box menunjukan implementasi algoritma priority scheduling berjalan dengan baik. Kata Kunci : Algoritma Priority Scheduling, extreme programming, Aplikasi, Mobil Kantor Priority Scheduling is a priority scheduling algorithm. Each process is equipped with a priority number (integer value is usually the largest priority). Work gives priority to the process that has the highest priority. If several processes have the same priority, an algorithm will be used. First- come-first-served (FCFS) scheduling. Priority scheduling can also be run preemptively or non- preemptively. In preemptive, if a newly arrived process has a higher priority than the currently running process, the currently running process is terminated, then transferred to the newly arrived process. Meanwhile, in non-preemptive, the newly arrived process cannot interfere with the running process, but is only placed in the front queue. In this study, the authors used a software development method, namely the Extreme Programming method. Extreme programming (XP) is a methodology in the development of agile software development methodologies that focus on coding which is the main activity in all stages of the software development cycle. The priority scheduling algorithm has been successfully implemented in a car usage application. This is proven by the resulting employee priority order based on priority rules, namely the position in the application. With the priority scheduling algorithm, the queue sequence becomes dynamic as requests enter according to the priority rules set. The results of the system test both with the white box and black box show that the implementation of the priority scheduling algorithm is going well. Kata Kunci : Algoritma Priority Scheduling, Aplikasi, Mobil Kantor

Item Type: Thesis (S1)
NIM/NIDN Creators: 41516120039
Uncontrolled Keywords: Algoritma Priority Scheduling, extreme programming, Aplikasi, Mobil Kantor Algoritma Priority Scheduling, Aplikasi, Mobil Kantor
Subjects: 000 Computer Science, Information and General Works/Ilmu Komputer, Informasi, dan Karya Umum > 000. Computer Science, Information and General Works/Ilmu Komputer, Informasi, dan Karya Umum > 004 Data Processing, Computer Science/Pemrosesan Data, Ilmu Komputer, Teknik Informatika
Divisions: Fakultas Ilmu Komputer > Informatika
Depositing User: ALFINA DHEA NOVA
Date Deposited: 28 Mar 2023 03:22
Last Modified: 28 Mar 2023 03:22
URI: http://repository.mercubuana.ac.id/id/eprint/75550

Actions (login required)

View Item View Item