Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

ANALYSIS OF THREE SERVERS CLOSED SERIES QUEUING NETWORK WITH DELAY TIME USING MAX-PLUS ALGEBRA

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 3 (2025) · hlm. 1513–1524

DOI
10.30598/barekengvol19iss3pp1513-1524
ISSN
2615-3017, 1978-7227
Terbit
2025-07-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Max-Plus Algebra, which is the union of the set of all real numbers with an infinite singleton, equipped with maximum (max) and plus (+) operations, can be used to model and analyze algebraically the dynamics of a closed queuing network. This study aims to analyze the effect of delays in the start time of service activities on a closed series queuing network with three servers. This study is a study based on literature studies, mathematical model studies and simulations assisted by the Scilab computer program. The results show that the max-plus eigenvalue of a closed series queuing network with 3 servers, which is also the periodicity of network dynamics, is the largest service time of the server in the network. Delays in servers with the largest service time will continue to propagate for subsequent schedules. Delays in servers whose service time is not the maximum can still be tolerated, as long as the delay does not exceed the size of the element in the initial max-plus eigenvector, which corresponds to its largest service time. In this case, the system will be able to return to normal according to the original schedule, after undergoing a maximum of 4 stages of the service process since the beginning of the delay. Meanwhile, delays that exceed this will cause network scheduling to be late and will continue to spread to subsequent services.

Jaringan kolaborasi para penulis

3 penulis · 2 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Sanata Dharma University
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Dominikus Arif Budi PrasetyoSanata Dharma University1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ANALYSIS OF THREE SERVERS CLOSED SERIES QUEUING NETWORK WITH DELAY TIME USING MAX-PLUS ALGEBRA</dc:title>
	<dc:creator>Rudhito, Marcellinus Andy</dc:creator>
	<dc:creator>Putra, Dewa Putu Wiadnyana</dc:creator>
	<dc:description xml:lang="en-US">Max-Plus Algebra, which is the union of the set of all real numbers with an infinite singleton, equipped with maximum (max) and plus (+) operations, can be used to model and analyze algebraically the dynamics of a closed queuing network. This study aims to analyze the effect of delays in the start time of service activities on a closed series queuing network with three servers. This study is a study based on literature studies, mathematical model studies and simulations assisted by the Scilab computer program. The results show that the max-plus eigenvalue of a closed series queuing network with 3 servers, which is also the periodicity of network dynamics, is the largest service time of the server in the network. Delays in servers with the largest service time will continue to propagate for subsequent schedules. Delays in servers whose service time is not the maximum can still be tolerated, as long as the delay does not exceed the size of the element in the initial max-plus eigenvector, which corresponds to its largest service time. In this case, the system will be able to return to normal according to the original schedule, after undergoing a maximum of 4 stages of the service process since the beginning of the delay. Meanwhile, delays that exceed this will cause network scheduling to be late and will continue to spread to subsequent services.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/16331</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss3pp1513-1524</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 3 (2025): BAREKENG: Journal of Mathematics and Its Application; 1513-1524</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss3year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/16331/10686</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Marcellinus Andy Rudhito, Dewa Putu Wiadnyana Putra</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>