Optimasi Kinerja Pada Cross-Organizational Business Process Model Informatika Institut Teknologi Sepuluh Nopember Surabaya

Haryadita, Fitrianing (2015) Optimasi Kinerja Pada Cross-Organizational Business Process Model Informatika Institut Teknologi Sepuluh Nopember Surabaya. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.

[thumbnail of 5111100106-Undergradutae Thesis.pdf]
Preview
Text
5111100106-Undergradutae Thesis.pdf - Published Version

Download (17MB) | Preview

Abstract

Optimasi cross-organizational business process adalah salah satu masalah yang harus dipecahkan. Untuk mengoptimasi kinerja dalam cross-organizational business process yang pertama dilakukan adalah melakukan process discovery terhadap model proses bisnis dari event log. Banyak algoritma process discovery yang telah diterapkan seperti Alpha, Alpha ++ dan Heuristic Miner, tetapi tidak dapat men-discover parallel OR. Oleh kerena itu Tugas Akhir ini memodifikasi Heuristic Miner dengan menggunakan interval threshold untuk men-discover parallel XOR, AND, dan OR. Interval threshold ditentukan berdasarkan rata-rata dari positive dependency measure dalam dependency matriks.
Setelah mendapatkan model dari cross-organizational business process event log, kemudian dilakukan optimasi kinerja dengan mendapatkan durasi minimum proses bisnis dan biaya tambahan yang minimum. CPM crashing project adalah salah astu metode yang digunakan untuk time–cost optimization. Tetapi CPM crashing project memerlukan beberapa data untuk melakukan percepatan durasi proses bisnis tetapi pada realitanya banyak data yang berbentuk single timestamp event log yang tidak memiliki
viii
data yang dibutuhkan untuk CPM crashing project. Oleh karena itu dalam Tugas akhir ini menggunakan perhitungan rata-rata durasi eksekusi dan biaya setiap aktivitas dari setiap case untuk menentukan data optimasi yang digunakan untuk CPM crashing project. Kemudian linear programming digunakan untuk mendapatkan durasi minimum dan biaya tambahan minimum dari proses bisnis.
Hasil uji coba menunjukkan bahwa modified Heuristic Miner dapat discover OR split dan join, dan linear programming dengan data optimasi yang telah dihitung sebelumnya dapat melakukan optimasi terhadap cross-organizational business process dengan mendapatkan minimum durasi dan minimum biaya tambahan yang digunakan.
========================================================================================================
In cross-organizational business process model performance optimization is one of the problem which should be solve. To optimize the cross-organizational business process model the first thing to do is discover the business process from event log. Many algorithms have been employed for process discovery, such as Alpha, Alpha ++ and Heuristic Miner but they cannot discover processes containing parallel OR. Therefor in this undergraduate thesis represents the modified Heuristic Miner which utilizes the threshold intervals to discover parallel XOR, AND, and OR. The threshold intervals are determined based on average positive dependency measure in dependency matrix.
After getting the model of cross-organizational business process event log then optimize the model to get the minimum duration of process and minimum additional cost which is needed. CPM crashing project is one of method to solve the time–cost optimization. But CPM crashing project need some data to speeding up the process business. But in reality there are a lot of data which is represent using single timestamp event log which does not provide data to do CPM crashing project. Therefor this undergraduate thesis represents a method to get data which is use to crashing project. The data is got from averaging time execution
x
of each activity in case in event log. Then to crashing the project this undergraduate thesis use linear programming to get minimum duration and minimum additional cost.
The results show that the modified Heuristic Miner can discover OR split and join, and using linear programming use the data which is calculate, this undergraduate thesis can optimize the performance of cross-organizational business process by getting minimum makspan and minimum additional cost.

Item Type: Thesis (Undergraduate)
Additional Information: RSIf 005.54 Har o
Uncontrolled Keywords: Process Discovery, Discovery Parallel Activity OR, Modified Heuristic Miner, Time–cost Optimization, Single Timestamp Event Log, Cross-Organizaional Business Process Model, Linear Programming
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science. EDP
Divisions: Faculty of Information Technology > Informatics Engineering > 55201-(S1) Undergraduate Thesis
Depositing User: Mr. Tondo Indra Nyata
Date Deposited: 18 Apr 2018 03:52
Last Modified: 24 Aug 2018 03:07
URI: http://repository.its.ac.id/id/eprint/51759

Actions (login required)

View Item View Item