Article Per Year (5 Year)
p-Index From 2021 - 2026
0.659
P-Index
This Author published in this journals
All Journal Jurnal Matematika SAINS DAN MATEMATIKA AdMathEdu : Jurnal Ilmiah Pendidikan Matematika, Ilmu Matematika dan Matematika Terapan Jurnal Fourier Jurnal Matematika: MANTIK BAREKENG: Jurnal Ilmu Matematika dan Terapan JTAM (Jurnal Teori dan Aplikasi Matematika) Jurnal Bakti Saintek: Jurnal Pengabdian Masyarakat Bidang Sains dan Teknologi Indonesian Journal of Industrial Engineering & Management Kaunia: Integration and Interconnection of Islam and Science Journal
Noor Saif Muhammad Mussafi
UIN Sunan Kalijaga Yogyakarta
Religion Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Energy Engineering Industrial & Manufacturing Engineering Mathematics Mechanical Engineering Physics Transportation Other

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

Found 22 Documents
Search

 1   2   3 
Optimasi Radio Frequency Unit Berbasis Interferensi Kanal Menggunakan Pendekatan Upper Bound Bilangan Kromatik Noor Saif Muhammad Mussafi
Jurnal Matematika Vol 3 No 1 (2013)
Publisher : Mathematics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/JMAT.2013.v03.i01.p30

Abstract

Gangguan gelombang transmisi radio sering terjadi dikarenakan kesenjangan antara bandwith frekuensi yang tersedia dan tingginya permintaan frekuensi. Telaah pewarnaan graf khususnya algoritma Welsh-Powell diharapkan dapat memberikan alternatif solusi permasalahan tersebut. Penelitian ini mengkaji optimasi radio frequency unit berbasis interferensi kanal menggunakan pendekatan upper bound bilangan kromatik. Data mengenai persebaran radio akan direpresentasikan dalam bentuk graf dengan mempertimbangkan tingkat interferensi yaitu kuat medan listrik, selanjutnya akan dianalisis menggunakan pewarnaan graf dengan algoritma Welsh-Powell. Hasil penelitian memberikan alternatif model distribusi frekuensi radio yang optimal.
PEMODELAN SISTEM ANTRIAN MULTI-CHANNELJASA TELLER PADA BANK SYARIAH DI YOGYAKARTA UNTUK MENINGKATKAN KINERJA PERUSAHAAN Noor Saif Muhammad Mussafi
AdMathEdu : Jurnal Ilmiah Pendidikan Matematika, Ilmu Matematika dan Matematika Terapan Vol 5, No 2: Desember 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (294.303 KB) | DOI: 10.12928/admathedu.v5i2.4770

Abstract

OPTIMISASI PORTOFOLIO RESIKO MENGGUNAKAN MODEL MARKOWITZ MVO Noor Saif Muhammad Mussafi
AdMathEdu : Jurnal Ilmiah Pendidikan Matematika, Ilmu Matematika dan Matematika Terapan Vol 1, No 1: Juni 2011
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/admathedu.v1i1.4879

Abstract

Optimasi Portofolio Resiko Menggunakan Model Markowitz MVO Dikaitkan Dengan Keterbatasan Manusia Dalam Memprediksi Masa Depan Dalam Perspektif Al-Qur`an Noor Saif Muhammad Mussafi
Jurnal Fourier Vol. 1 No. 1 (2012)
Publisher : Program Studi Matematika Fakultas Sains dan Teknologi UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (939.306 KB) | DOI: 10.14421/fourier.2012.11.27-35

Abstract

Risk portfolio on modern finance has become increasingly technical, requiring the use of sophisticated mathematical tools in both research and practice. Since companies cannot insure themselves completely against risk, as human incompetence in predicting the future precisely that written in Al-Quran surah Luqman verse 34, they have to manage it to yield an optimal portfolio. The objective here is to minimize the variance among all portfolios, or alternatively, to maximize expected return among all portfolios that has at least a certain expected return. Furthermore, this study focuses on optimizing risk portfolio so called Markowitz MVO (Mean-Variance Optimization). Some theoretical frameworks for analysis are arithmetic mean, geometric mean, variance, covariance, linear programming, and quadratic programming. Moreover, finding a minimum variance portfolio produces a convex quadratic programming, that is minimizing the objective function 𝑄𝑥with constraints𝜇 𝑇 𝑥 ≥ 𝑅and𝐴𝑥 = 𝑏. The outcome of this research is the solution of optimal risk portofolio in some investments that could be finished smoothly using MATLAB R2007b software together with its graphic analysis.
Pewarnaan Simpul Dengan Algoritma Welch-Powell Pada Traffic Light Di Yogyakarta Ana Mardiatus Soimah; Noor Saif Muhammad Mussafi
Jurnal Fourier Vol. 2 No. 2 (2013)
Publisher : Program Studi Matematika Fakultas Sains dan Teknologi UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (505.299 KB) | DOI: 10.14421/fourier.2013.22.73-79

Abstract

Traffic congestion is a problem which is often found in big cities in Indonesia. This requires a range of solutions, one of them with the settings of the traffic light. Traffic light arrangement can be completed with graph theory. Part of graph theory a graph coloring is used. Staining graf three i.e. coloring is differentiated into a knot, staining the sides, and staining region. This research examines the arrangements about traffic light using colorization algorithm Welch knot with Powell. The intersection of Data represented in the graph, which is then solved by coloring the vertices, then look for the value of the effective duration of the time compared to a traffic light settings occur at several intersections in Yogyakarta. Completion of traffic light arrangement using staining nodes provide alternative solutions duration lit the red light and green light is more effective than the secondary data at several intersections in Yogyakarta.
Aplikasi Algoritma Branch and Bound Untuk Optimasi Jalur Pemadam Kebakaran Kota Yogyakarta Sri Margiyani; Noor Saif Muhammad Mussafi
Jurnal Fourier Vol. 3 No. 1 (2014)
Publisher : Program Studi Matematika Fakultas Sains dan Teknologi UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (483.497 KB) | DOI: 10.14421/fourier.2014.31.59-66

Abstract

Kasus kebakaran di Indonesia, khususnya Kota Yogyakarta dari tahun ke tahun masih menunjukkan angka yang tinggi. Hal ini mengakibatkan kerugian yang cukup tinggi bagi korban kebakaran. Untuk meminimalisasi terjadinya korban jiwa dan kerugian secara material saat terjadi kebakaran, maka pihak pemadam kebakaran mengupayakan melalui rute terpendek untuk sampai di lokasi kebakaran. Tujuan dari penelitian ini adalah pencarian rute terpendek jalur pemadam kebakaran dari kantor pemadam sampai ke lokasi kebakaran. Permasalahan pencarian rute terpendek jalur pemadam kebakaran secara abstrak dapat digambarkan dengan suatu graf yang merupakan masalah optimasi dalam pencarian rute terpendek (Shortest Path Problem). Pemecahan permasalahan tersebut adalah dengan merepresentasikan peta pemadam kebakaran ke dalam bentuk graf berbobot dan berarah, selanjutnya permasalahan diselesaikan menggunakan Algoritma Branch and Bound. Perhitungan dilakukan secara manual dengan jarak (dalam meter) sebagai bobot perhitungan. Berdasarkan perhitungan menggunakan Algoritma Branch and Bound untuk optimasi jalur pemadam kebakaran Kota Yogyakarta untuk wilayah Kecamatan Umbulharjo menghasilkan solusi rute: Kantor pemadam kebakaran – Jln. Ipda Tut Harsono - Jln. Kusumanegara – Jln. Glagahsari – Kantor Kecamatan Umbulharjo) dengan total jarak 5305 meter atau 5,035 km.
Rancang Bangun Vehicle Routing Problem Menggunakan Algoritma Tabu Search Sulistiono Sulistiono; Noor Saif Muhammad Mussafi
Jurnal Fourier Vol. 4 No. 2 (2015)
Publisher : Program Studi Matematika Fakultas Sains dan Teknologi UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1434.336 KB) | DOI: 10.14421/fourier.2015.42.113-122

Abstract

Pendistribusian produk berperan penting dalam dunia industri. Salah satu usaha yang dapat dilakukan perusahaan untuk mengoptimalkan pendistribusian produk adalah meminimalkan biaya tranportasi melalui penentuan rute optimal kendaraan yang disebut dengan VRP (Vehicle Routing Problem). Tujuan dari VRP adalah menentukan rute optimal yaitu rute dengan jarak minimum untuk mendistribusikan produk kepada konsumen. Salah satu variasi VRP adalah Capacitated Vehicle Routing Problem (CVRP), yaitu VRP dengan kendala kapasitas kendaraan. Kasus CVRP tersebut dapat diselesaikan dengan menggunakan Algoritma Tabu Search. Cara kerja Algoritma Tabu Search dimulai dengan penentuan initial solution menggunakan Nearest Neighbor, evaluasi move menggunakan metode 2-Opt, Relocated, dan Exchange, update Tabu List, kemudian apabila kriteria pemberhentian terpenuhi maka proses Algoritma Tabu Search berhenti jika tidak, maka kembali pada evaluasi move. Proses perhitungan Algoritma Tabu Search dilakukan secara manual dan rancang bangun menggunakan MATLAB pada PT Sinergi Bio Natural. Berdasarkan proses perhitungan manual dan rancang bangun diperoleh dua solusi optimal yaitu rute dengan jarak terpendek dengan total jarak optimal sebesar 101,1 km.
Application of Cutting Stock Problem in Minimizing The Waste of Al-Quran Cover Noor Saif Muhammad Mussafi
Kaunia: Integration and Interconnection Islam and Science Vol. 12 No. 1 (2016)
Publisher : Fakultas Sains dan Teknologi UIN Sunan Kalijaga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14421/kaunia.1036

Abstract

Cutting stock problem is the problem of cutting standard-sized pieces of stock material, such as vinyl rolls (synthetic leather) into pieces of specified sizes while minimizing material wasted. The study of cutting stock problem is expected to provide an alternative solution to publishing industrial. This study examines the cutting stock problem based on illustrative example of Quran Publisher using the integer programming. The problem is transformed into optimization model so that it can be solved using solver menu in Microsoft Excel. The results provide decision that meets the consumer demand and has a minimum waste of raw material that used for Al-Quran cover.
PENERAPAN GREEDY COLORING ALGORITHM PADA PETA KOTAMADYA YOGYAKARTA BERBASIS FOUR-COLOUR THEOREM Noor Saif Muhammad Mussafi
Kaunia: Integration and Interconnection Islam and Science Vol. 11 No. 1 (2015)
Publisher : Fakultas Sains dan Teknologi UIN Sunan Kalijaga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14421/kaunia.1078

Abstract

Pewarnaan peta merupakan suatu proses pemberian warna pada daerah-daerah pada suatu peta sehingga pada kedua daerah yang berbatasan langsung akan memiliki warna yang berbeda. Dalam hal ini diperlukan warna yang boleh jadi sama banyak dengan jumlah daerah pada kotamadya tertentu yang dapat menyebabkan tidak efisien. Oleh karena itu perlu ditelaah bagaimana penentuan warna pada peta dengan menggunakan warna pada peta seminimal mungkin. Dalam teori graf, persoalan ini dapat direpresentasikan menggunakan graf dual dan pewarnaan graf yang lebih dikenal dengan bilangan kromatik. Penyelesaian  masalah bilangan kromatik dapat dianalisis menggunakan algoritma greedy coloring. Penelitian ini bertujuan menerapkan algoritma greedy coloring pada peta Kotamadya Yogyakarta berbasis teorema 4 warna.
Optimization of Transportation Distribution Costs Using Improved Vogel's Approximation Method (IVAM) (Case Study: PT. Sinar Putra Pertam) Mussafi, Noor Saif Muhammad; Adianta, Alya
IJIEM - Indonesian Journal of Industrial Engineering and Management Vol 5, No 2: June 2024
Publisher : Program Pascasarjana Magister Teknik Industri Universitas Mercu Buana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22441/ijiem.v5i2.27288

Abstract

Distribution is the process of distributing goods from source to destination. The main problem with distribution is the inefficiencies in distribution costs. The distribution problem can be solved by transportation methods. The transportation method is carried out in two stages, namely finding the initial solution then looking for the optimal solution. This study uses Improved Vogel's Approximation Method (IVAM) initial solution method and Modified Distribution Method (MODI) as the optimal solution method in distributing 3 Kg LPG gas PT. Sinar Putra Pertam. This study aims to find out how IVAM and MODI work in getting optimal solutions, and compare the results of these calculations with the calculation of 3 Kg LPG gas distribution costs from the company. In this study, there were 2 sources of LPG gas filling which were distributed using a fleet of colt trucks to 15 destinations. The distribution cost is calculated based on fleet fuel consumption. The results of the initial solution calculation show IVAM requires three iterations to get a solution. While the calculation results of the MODI optimization test require one iteration to achieve the optimal solution. The distribution cost using IVAM and MODI is the same amounting to IDR 6,816,230.00 so that it is smaller than the conventional calculation results from the company, which is IDR 9,307,000.00. Based on these results, the transportation method used in this study can save 26.76% of the total distribution cost.
Co-Authors Adianta, Alya Ana Mardiatus Soimah Ana Mardiatus Soimah, Ana Mardiatus Epha Diana Supandi Ika Nugraheni Malahayati Malahayati Mr. Sulistiono, Mr. Sri Margiyani Sri Margiyani, Sri Sulistiono Sulistiono Zain, Zuva Amalina