ANALISIS SISTEM ANTREAN DENGAN DISIPLIN PELAYANAN PREEMPTIVE

Nur Indra Istiani; Nikenasih Binatari

doi:10.21831/jsd.v6i2.15545

ANALISIS SISTEM ANTREAN DENGAN DISIPLIN PELAYANAN PREEMPTIVE

Nur Indra Istiani, Program Studi Matematika, Jurusan Pendidikan Matematika FMIPA, Indonesia
Nikenasih Binatari, Program Studi Matematika, Jurusan Pendidikan Matematika FMIPA, Indonesia

10.21831/jsd.v6i2.15545

Abstract

Disiplin pelayanan preemptive merupakan salah satu aturan dalam sistem antrean dimana server melayani customer berdasarkan urutan prioritasnya. Tujuan dari penulisan ini adalah menganalisis model sistem antrean dengan disiplin pelayanan preemptive, mendapatkan ukuran keefektifannya kemudian membandingkannya dengan disiplin pelayanan umum. Persamaan keseimbangan dalam penulisan ini diperoleh dengan mengasumsikan disiplin pelayanan Preemptive memiliki dua prioritas pelayanan dan proses antrian mengikuti Quasi Birth and Date Process. Selanjutnya, ukuran keefektifan diperoleh menggunakan metode probability generating function atas persamaan keseimbangan.

ANALYSIS OF QUEUE SYSTEM WITH PREEMPTIVE SERVICE DISCIPLINE

Preemptive service discipline is one of rules in the queue system where the server serves customers based on the order of priority. The purpose of this paper is to analyze the queueing model using Preemptive service discipline, to obtain its effective measurements and to compare it towards the general service discipline. The balance equation in this paper are obtained by assuming that Preemptive service discipline has two services priority and the queueing process follows Quasi Birth and Date Process. Next, using probability generating function (PGF) method, we obtain the measurement of effectiveness.

Keywords

antrean, keefektifan, PGF, preemptive

Full Text:

PDF

References

Durratun, N, & Sugito. (2011). Sistem Antrean Dengan Prioritas Pelayanan. Prosiding, Seminar Nasional Statistika. Semarang: Universitas Diponegoro.

Kailash, C. (2011). A Non-Preemptive Priority Queueing System with a Single Server Serving Two Queues M/G/1 and M/D/1 with Optional Server Vacations Based on Exhaustive Service of the Priority Units. Academic Journal, 26 (1), 14-17

Tommy ,Y.A, Laksmi dan Prita. (2013). Distribusi Waktu Tunggu Pada Disiplin Pelayanan Prioritas (Studi Kasus: Instalasi Rawat Darurat Di RSUD Dr. Soetomo Surabaya). Jurnal Sains dan Seni Pomits, 1 (1), 1-6

S.S. Mishra., D.K. Yadav. (2009), Cost and Profit Analysis of Markovian Queueing System with Two Priority Classes: A Computational Approach. International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering Vol:3, No:9.

Miller, R. (1960). Priority Queues. The Annals of Mathematical Statistics, 31(1), 86-103. Retrieved from http://www.jstor.org/stable/2237496

Ilyashenko A., Zayats O., Muliukha V., Laboshin L. (2014) Further Investigations of the Priority Queuing System with Preemptive Priority and Randomized Push-Out Mechanism. In: Balandin S., Andreev S., Koucheryavy Y. (eds) Internet of Things, Smart Spaces, and Next Generation Networks and Systems. NEW2AN 2014. Lecture Notes in Computer Science, vol 8638. Springer, Cham

Gross, D, & Harris, C. M. (1998). Fundamental of Queuing Theory 3rd. New York: John Wiley & Sons.

Gunter, dkk. (2006). Queueing Networks and Markov Chains. Canada: John Wiley & Sons.

DOI: https://doi.org/10.21831/jsd.v6i2.15545