Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal CAUCHY: Jurnal Matematika Murni dan Aplikasi Jurnal Ilmiah Teknik Industri Jurnal Fourier
Muchammad Abrori, Muchammad
UIN Sunan Kalijaga
Computer Science & IT Economics, Econometrics & Finance Education Industrial & Manufacturing Engineering Mathematics

Published : 12 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 12 Documents
Search

 1   2 
ANALISIS KUALITAS LULUSAN BERDASARKAN TINGKAT KEPUASAN PENGGUNA LULUSAN Setyaningsih, Ira; Abrori, Muchammad
Jurnal Ilmiah Teknik Industri Vol. 12, No. 1, Juni 2013
Publisher : Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In education, the students are the products to be input and the output are graduates. Users of graduates are consumers who need to know the level of satisfaction to provide a self-evaluation in improving the institutions. It is also stated in the accreditation forms BAN PT. However, a grain questions that sought to know is very little. The research was conducted at a university in Yogyakarta. Research trying to describe in detail the attributes of quality of graduates based on the user satisfaction level graduates. Object of study is alumni and also alumni users. The study was conducted during the months of August to November 2012. Attributes used are Communication Skills, Organizational Skills, Leadership, Logic, Effort, Ethics, Group and Other Skills. Other attributes are attributes about the ability of areas of expertise. From the results obtained, the attributes that need attention are Organizational Skills and Leadership with the highest gap -0.82. Overall, users of alumni do not feel satisfied, because all negative attributes.
PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN Abrori, Muchammad; Wahyuningsih, Rina
Jurnal Ilmiah Teknik Industri Vol. 11, No. 1, Juni 2012
Publisher : Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Matching is a part of graph theory that discuss to make a pair, that can be used to solve many problems; one of them is the assignment problem. The assignment problem is to make a pair problem for n as the employees and for n as the duties, therefore each employee gets one duty, and each duty is given exactly for each employee. The assignment problem can be solved by determining the matching in weighted bipartite graph through Hungarian Method. It can be determined from the alternating tree of a formed edge. If there is augmenting path, that augmenting path is used to form the more number of matching. If the formed path is alternating path, therefore the process is labeling the new node until finding the augmenting vertices. This matching is called as the perfect matching with the number of maximum weighed side in weighted bipartite graphs. The result matching is the solution for the assignment problem by giving an employee with a duty.
RANCANG BANGUN SISTEM DETEKSI DAGING AYAM BANGKAI MENGGUNAKAN SENSOR WARNA DAN JARINGAN SYARAF TIRUAN Abrori, Muchammad; Rakhmadi, Frida Agung; Nurochman, Nurochman
Jurnal Ilmiah Teknik Industri Vol. 14, No. 1, Juni 2015
Publisher : Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Telah dibuat sistem deteksi daging ayam bangkai menggunakan sensor warna dan jaringan syaraf tiruan. Tujuan pembuatan sistem ini adalah untuk membantu masyarakat umum dalam mendeteksi daging ayam broiler bangkai. Sistem ini dibuat menggunakan sensor warna. Tahapan penelitian meliputi pembuatan perangkat keras, pembuatan perangkat lunak, dan pengujian sistem. Hasilnya, sistem dapat bekerja dengan baik terutama untuk mendeteksi sampel daging bagian dada, tepong, dan paha.
PENYELESAIAN MATCHING GRAF DENGAN MENGGUNAKAN METODE HUNGARIAN DAN PENERAPANNYA PADA PENEMPATAN KARYAWAN DI SUATU PERUSAHAAN Rahman, Aulia; Abrori, Muchammad; Musafi, Noor Saif Muhammad
Jurnal Fourier Vol 3, No 2 (2014)
Publisher : UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (697.559 KB)

Abstract

Semakin meningkatnya kompetisi global menuntut setiap perusahaan untuk meningkatkan kualitas serta efektifitas kinerja karyawannya yang pada akhirnya diharapkan dapat meningkatkan keuntungan. Penempatan sejumlah X karyawan pada Y pekerjaan dimana masing-masing karyawan mempunyai kompetensi untuk menyelesaikan semua pekerjaan dengan mempertimbangkan beberapa aspek seperti memaksimalkan  keuntungan yang diperoleh atau meminimalkan waktu yang diperlukan sebagai akibat dari penempatan karyawan pada pekerjaan dikenal dengan Optimal Assignment Problem. Tujuan dari penulisan ini adalah untuk mencari solusi pada Optimal Assignment Problem dimana aspek yang akan dioptimalkan adalah keuntungan dari penempatan sejumlah karyawan pada pekerjaan yang dapat diperoleh dengan menerapkan konsep teori graf. Dalam hal ini permasalahan dinyatakan sebagai graf bipartit khususnya graf bipartit lengkap berbobot yang menerapkan konsep matching, yaitu pencarian matching sempurna dengan bobot paling optimal.  Untuk mencari matching sempurna dengan bobot paling optimal maka dapat digunakan sebuah algoritma optimasi yaitu metode Hungarian. Dengan menggunakan  metode Hungarian, diperoleh matching sempurna dengan bobot yang optimal pada graf bipartit lengkap berbobot. Matching dikatakan sempurna jika telah memenuhi semua himpunan simpul dan . Matching yang dihasilkan merupakan solusi dari Optimal Assignment Problem yakni memasangkan seorang karyawan tepat satu dengan sebuah pekerjaan dan bobotnya menyatakan keuntungan optimal yang akan diperoleh oleh suatu perusahaan.
Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta) Abrori, Muchammad; Setiyani, Rike Nur
Jurnal Fourier Vol 4, No 2 (2015)
Publisher : UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1564.382 KB)

Abstract

Yogyakarta offers many tourist attractions, from nature based tourism, culinary tourism until cultural tourism. With so many tourist attractions offered by Yogyakarta, tourist often finds it difficult to arrange their travel schedule (from choosing which tourist attractions to be visited until choosing which route tourist should takes to maximize their vacation time). Therefore, it’s required to have a way to determine the shortest tour route so tourist can make their tour in the Yogyakarta effective. This problem can be categorized as Traveling Salesman Problem (TSP) case. There are a lot of methods can be used to find the shortest route in Travelling Salesman Problems (TSP) case. To solve the problem, which is to find the shortest tour route in Yogyakarta, Algorithm Best-First Travelling will be used in this undergraduate thesis. The implementation of Algorithm Best-First Search to find the shortest tour route in Yogyakarta can be used to produce a solution for tourist to choose the shortest tour package and decide which route they should take. The premium tour package produces tour route from Adi Sucipto Airport-Gembira Loka Zoo- Purawisata-N’dalem Gamelan Hotel-Yogyakarta Palace-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Adi Sucipto Airport with distance covered 20.297 meter. The middle tour package produces tour route from Tugu railway station-Benteng Vredeburg Museum- Taman Pintar-Yogyakarta Palace-Mawar Asri Hotel-Tamansari-Purawisata-Gembira Loka Zoo-Tugu railway station with distance covered 11.772 meter. The economy tour package produces tour route from Giwangan bus station- Gembira Loka zoo-Purawisata-Yogyakarta Palace-Mitra Hotel-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Giwangan bus station with distance covered 14.037 meter.
Pengujian Optimalisasi Jaringan Kabel Fiber Optic Di Universitas Islam Indonesia Menggunakan Minimum Spanning Tree Abrori, Muchammad; Ubaidillah, Najib
Jurnal Fourier Vol 3, No 1 (2014)
Publisher : UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (413.45 KB)

Abstract

Universitas Islam Indonesia (UII) intergrated campus computer network built since 1995. Development of UII integrated campus computer network is using a star topology and fiber optic (FO) cable. Considering that the star topology is the topology that requires a lot of wires, this study was conducted to determine and examine how the application of graph on the FO cable network UII integrated campus in order to minimize the cost, because FO cable network can be modeled by a graph where the buildings as points, while FO cable that connects to each building as a line. This type of research that is used here is a case study, in which data collection by observation, interviews, and documentation. This study used 4 algorithms, that is Kruskal algorithm, Prim, Boruvka and Solin algorithm to find the Minimum Spanning Tree. Based on the research that has been done, the conclution about the troubleshooting steps of optimization UII integrated campus FO cable network based graph theory has been got. From the four algorithms obtained the most optimal results FO cable length 4.700 meters long and is 1.590 meters cable lines. While the results of observations made, it is known that the existing computer network in UII integrated campus has a cable length of 6.120 meters and 2.050 meters long track. The results of the analysis showed that the resulrs of the study 23.2% more optimal than the existing computer networks in UII integrated campus.
KONSEP DASAR RUANG METRIK CONE Bahtiar, A. Rifqi; Abrori, Muchammad; Malahayati, Mrs.
Jurnal Fourier Vol 3, No 2 (2014)
Publisher : UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (334.113 KB)

Abstract

Ruang metrik merupakan salah satu konsep yang penting dalam ranah analisis fungsional. Dikatakan penting karena konsep ruang metrik banyak dipakai dalam teori-teori matematika yang lain dan sering dipakai juga dalam studi fisika lanjut. Ruang metrik adalah suatu himpunan yang berlaku suatu metrik. Metrik adalah suatu fungsi dengan domain sembarang himpunan yang tak kosong menuju kodomain bilangan real atau fungsi bernilai real dengan definisi urutan dalam bilangan real. Pada tahun 2007 Huang Long Guang dan Zhang Xian menggeneralisasikan konsep ruang metrik menjadi ruang metrik cone. Tujuan dari penelitian ini adalah untuk mengkaji konsep dasar ruang metrik cone yang meliputi mengkaji barisan konvergen, barisan cauchy beserta contohnya dan hubungan barisan konvergen dan barisan terbatas dalam ruang metrik cone, mengkaji hubungan ruang metrik dan ruang metrik cone dan mengkaji salah satu teorema titik tetap dalam ruang metrik cone. Penelitian ini dilakukan dengan menggunakan metode studi literatur yaitu dengan membahas dan menjabarkan konsep-konsep yang sudah ada di dalam literatur. Diharapkan dari penelitian ini dapat memberikan gambaran umum tentang konsep dasar ruang metrik cone. Selanjutnya dari penelitian ini dapat dibuktikan bahwa setiap ruang metrik adalah ruang metrik cone dengan ruang Banach dan cone tertentu dan juga dapat dibuktikan bahwa pemetaan kontraktif pada ruang metrik cone dengan cone normal mempunyai titik tetap tunggal.
Metode Akra-Bazzi Sebagai Generalisasi Metode Master Dalam Menyelesaikan Relasi Rekurensi Abrori, Muchammad
Jurnal Fourier Vol 2, No 2 (2013)
Publisher : UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (323.889 KB)

Abstract

Rekurensi relation is an equation that relates the elements of a sequence. One of the benefits of the rekurensi relation can be used to calculate the running time/finish of an  algorithm. Some algorithms use approach devide-and-conquer in resolving a problem. Rekurensi relations with the approach of the devide and conquer can be solved by several methods. This research aims to know the Akra-Bazzi Method as an extension Method of the Master. This research began with the dissected the concept pertaining to the Relation Rekurensi, methods for resolving Relationship Rekurensi, and lastly about methods of AkraBazzi. Note that Akra-Bazzi Method can solve a rekurensi devide-and-conquer with shorter calculation.
RANCANG BANGUN SISTEM DETEKSI DAGING AYAM BANGKAI MENGGUNAKAN SENSOR WARNA DAN JARINGAN SYARAF TIRUAN Abrori, Muchammad; Rakhmadi, Frida Agung; Nurochman, Nurochman
Jurnal Ilmiah Teknik Industri Vol. 14, No. 1, Juni 2015
Publisher : Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v14i1.628

Abstract

Telah dibuat sistem deteksi daging ayam bangkai menggunakan sensor warna dan jaringan syaraf tiruan. Tujuan pembuatan sistem ini adalah untuk membantu masyarakat umum dalam mendeteksi daging ayam broiler bangkai. Sistem ini dibuat menggunakan sensor warna. Tahapan penelitian meliputi pembuatan perangkat keras, pembuatan perangkat lunak, dan pengujian sistem. Hasilnya, sistem dapat bekerja dengan baik terutama untuk mendeteksi sampel daging bagian dada, tepong, dan paha.
Problem of Maximum Matching in Non-Bipartite Graph Using Edmonds’ Cardinality Matching Algorithm and Its Applicationin the Battle of Britain Case Abrori, Muchammad; Jauhari, Mohammad Imam
CAUCHY Vol 5, No 4 (2019): CAUCHY
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (983.546 KB) | DOI: 10.18860/ca.v5i4.4294

Abstract

Matching is a part of graph theory that discusses pair. A matching M is called to be maximum if M has the highest number of  elements. A blossom which is encountered in non-bipartite graph can cause failure in process of finding the maximum matching in non-bipartite graph. One of the algorithms that can be used to find a maximum matching in non-bipartite graph is Edmonds’ Cardinality Matching Algorithm. Shrinking process is done in each blossom Bi that is encountered to become pseudovertex bi, in a way that each blossom does not interfere the process of finding a maximum matching in non-bipartite graph. In order to accelerate the finding, simple greedy method is used to perform initialization of matching and BFS algorithm is also used in constructing an alternating tree in a non-bipartite graph.The research discussed the finding of maximum  matching in non-bipartite graph using Edmonds’ cardinality matching algorithm. In addition, this research gave a sample of its application in the resolution of The Battle of Britain case. The result obtained is a maximum matching in non-bipartite graph. The maximum matching obtained is a solution to the case of The Battle of Britain.
Co-Authors A. Rifqi Bahtiar, A. Rifqi Amrul Hinung Primahayu, Amrul Aulia Rahman Frida Agung Rakhmadi, Frida Agung Ira Setyaningsih Jauhari, Mohammad Imam Mrs. Malahayati, Mrs. Najib Ubaidillah, Najib Noor Saif Muhammad Musafi, Noor Saif Muhammad Nurochman Nurochman, Nurochman Rike Nur Setiyani, Rike Nur Rina Wahyuningsih, Rina