Dekomposisi Model Proses Bisnis Tebang Muat Angkut (TMA) Menggunakan Refined Process Structure Tree (RPST) dan Metrik Kompleksitas

Safitri, Annisa Heparyanti and Yaqin, Muhammad Ainul and Utomo, Adi Heru (2020) Dekomposisi Model Proses Bisnis Tebang Muat Angkut (TMA) Menggunakan Refined Process Structure Tree (RPST) dan Metrik Kompleksitas. Jurnal Teknologi Informasi dan Terapan, 7 (2). pp. 107-112. ISSN 2354-838X

[img] Text (Hasil Cek Similarity)
Dekomposisi Model Proses Bisnis Tebang Muat Angkut (TMA) Menggunakan Refined Process Structure Tree (RPST) dan Metrik Kompleksitas (Cek Similarity).pdf - Supplemental Material

Download (2MB)
[img] Text (Hasil Peer Review)
Dekomposisi Model Proses Bisnis Tebang Muat Angkut (TMA) Menggunakan Refined Process Structure Tree (RPST) dan Metrik Kompleksitas.pdf

Download (94kB)
Official URL: http://jtit.polije.ac.id/index.php/jtit/article/vi...

Abstract

In an organization, some problems often arise, one of which lies in the complexity of business process modeling. In business processes, high complexity values are complicated to analyze and maintain as a whole, so a method is needed to break down the business process into smaller parts called the fragment process model. Therefore, a decomposition was carried out to decompose the process model to make it simpler. The benefit of decomposition is to make it easier for users to compose the required business process model. We used three different scenarios for the TMA process model to analyze each fragment. There is a process model with scenarios that tend to be the sequence, multi-branching, and nested branching. Furthermore, to support the results of the RPST, the calculation of the average complexity value with the Yaqin Complexity formula, and the standard deviation for the process model fragment was also carried out. Our experimental results found that the rate of the tree at the RPST affected the number of fragments. Also, we found that the more profound the tree depth, the higher the average complexity value. In this study, we found that scenarios that tend to be sequential, have the lowest average complexity value with the number 22, and a standard deviation value of 5,567. While the highest value is in the scenario that has nested branching, and there is a repetition process with an average complexity value of 29.8 and a standard deviation value of 13.405.

Item Type: Article
Subjects: 410 - Rumpun Ilmu Teknik > 450 - Teknik Elektro dan Informatika > 458 - Teknik Informatika
Divisions: Jurusan Teknologi Informasi > Prodi D4 Teknik Informatika > Publikasi
Depositing User: Adi Heru Utomo
Date Deposited: 28 Jun 2021 15:58
Last Modified: 15 Jun 2023 10:40
URI: https://sipora.polije.ac.id/id/eprint/5246

Actions (login required)

View Item View Item