Sahari, A
Unknown Affiliation

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

Found 24 Documents
Search

PENGATURAN PERSEDIAAN BERAS DI PERUM BULOG DIVRE SULTENG DENGAN METODE ECONOMIC ORDER QUANTITY (EOQ) Nildawati, Nildawati; Ratianingsih, R; Sahari, A
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 15 No. 2 (2018)
Publisher : Program Studi Matematika, Universitas Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (681.258 KB) | DOI: 10.22487/2540766X.2018.v15.i2.11355

Abstract

Perum BULOG of Central Sulawesi Division is a national rice logistic company that its responsibility is to guarantee the sufficiency to meet the rice needs. Perum BULOG also responsible to keep rice price stability. One of the rice price component is the inventory costs that need to be managed. In this research the management is refered to the rice scheme demand of four storages, that are Olaya, Lawanga, Jaya Kencana Toili and Galang. This study uses EOQ (Economic Order Quantity) that consist of five priorities, that are determining the of economical order, determining the amount of safety stock, determining the maximum inventory quantities, determining the reorder point and determining total inventory cost. The results showed that the number of economical order storage of Olaya is 1.817.120,57 kg/message, Lawanga is 1.893.400,78 kg/message, Jaya Kencana Toili is 1.575.543,38 kg/messages and Galang is 1.578.742,75 kg/message. The total Inventory Security for Olaya is 32.371,28 kg, Lawanga is 41.020,07 kg, Jaya Kencana Toili is 30.630,61 kg, and Galang is 57.307,99kg. The maximum inventory for Olaya is 1.849.491,85 kg, Lawanga is 1.934.420,85 kg, Jaya Kencana Toili is 1.606.173,99 kg, and Galang is 1.636.050,74 kg. The reorder point is proposed when rice stock of Olaya reaches 323.664,52 kg, Lawanga reaches 357.282,87 kg, Jaya Kencana Toili reaches 249.620,29 kg and Galang reaches 277.188 kg. The total inventory cost that use Economic Order Quantity is Rp. 2.507.626,39 for Olaya, Rp. 2.612.893,07 for Lawanga, Rp.2.174.249 ,87 for Jaya Kencana Toili, and Rp 2.178.665,00 for Galang. The Efficiency cost of rice supplies BULOG Division is Rp.40.405,29 for Olaya, Rp. 719.256,02 for Lawanga, Rp. 51187.63 for Jaya Kencana Toili, and Rp. 153.528,73 for Galang. These result gives greatest efficiency at the cost of supplies of Perum BULOG Division Central Sulawesi for Lawanga 22% as much.
OPTIMALISASI PERSEDIAAN BAHAN BAKAR MINYAK INDUSTRI (SOLAR) PADA PT. PRIMA SENTOSA ALAM LESTARI MENGGUNAKAN METODE ECONOMIC ORDER QUANTITY (EOQ) Santi, Santi; Jaya, A I; Sahari, A
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 16 No. 1 (2019)
Publisher : Program Studi Matematika, Universitas Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (490.289 KB) | DOI: 10.22487/2540766X.2019.v16.i1.12756

Abstract

PT. Prima Alam Lestari Sentosa is a company engaged in six areas such as transporter fuel, industrial fuel agents pertamina, SPPBE, general construction services, mining contractor, and the procurement of goods and services. In carrying out its production activity is associated with supplies of fuel oil. Where inventory is one of management activities related to storage costs and reservations so that the necessary optimization of inventory. In this study the authors using Economic Order Quantity to optimize the inventory. This study aims is to determine the inventory optimization of fuel oil at PT. Prima Alam Lestari Sentosa and compared it with the fuel inventory optimization EOQ method. . PT Prima Alam Lestari Sentosa set the amount every one reservations is 14212.50 liters with the number of bookings 317 timeseach year and the total cost of supply is 𝑅𝑝. 710.304.976,352,- while when using the EOQ method, the ordering amount is 20.225 liters with the number of bookings are as 223 times each year and the total inventory cost 𝑅𝑝. 668.280.488,26,-. Thus, in the year of 2016, it is about that the company's policy when using the EOQ method is equal to 𝑅𝑝. 24.024.488,092.Keywords : EOQ Method, Inventory, Optimization.
Prediksi Tingkat Pertumbuhan Ekonomi Provinsi Sulawesi Tengah Menggunakan Metode Backpropagation Jafaar, I M; Sahari, A; Lusiyanti, D
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 16 No. 2 (2019)
Publisher : Program Studi Matematika, Universitas Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (504.114 KB) | DOI: 10.22487/2540766X.2019.v16.i2.14986

Abstract

ABSTRACTEconomic growth in the region is the regional economy conditions change continuously towards a better State fora certain period. The slow economic growth became the latest leading indicator an area to develop. Indicators thatcan be used for example, GDP and inflation. On the research of these indicators will be used to predict the growthrate of the economy of Central Sulawesi province using the Backpropagation Neural Network Methods. Simulationof the program in the form of input data is represented 𝑥1 and 𝑥2 and biased 𝑏1 dan 𝑏2 symbolized. With hiddenlayers comprising 𝑧1, 𝑧2, 𝑧3, 𝑧4, … , 𝑧17 . and y as output. Based on the results and discussion has been done, can bedrawn the conclusion of process Neural Network prediction of Backpropagation with 1 hidden layer neurons andthe number 17 against 26 data represents data inflation and GDP of the year 2010 up to 2016 with sigmoid activationfunction binner was able to predict the rate of economic growth with a prediction error of 16.66%.Keywords : ANN, Backpropagation Method, Inflation, PDRB.
Optimalisasi Biaya Dan Waktu Pada Usaha Kerajinan Kayu Hitam Di Sumber Urip Ebony Dengan Menggunakan Metode Hungarian Maharani, M; Jaya, A I; Sahari, A
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 16 No. 2 (2019)
Publisher : Program Studi Matematika, Universitas Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (594.984 KB) | DOI: 10.22487/2540766X.2019.v16.i2.14987

Abstract

ABSTRACTPalu as the Capital of Central Sulawesi province is known as one of the crafts made from ebony. Ebony woodcraft industry in Palu begin to increase with the establishment of several business ebony, one of them is Sumber Urip Ebony Store that not only as a shop to sell the crafts, but at the same time as a place to produce the ebony wood crafts . This store have 9 workers and already have an adequate means of production. This study aimed is to propose the hungarian method to solve multi-objective assignment by optimizing the cost and time of production. From the results of the study is obtained that the total cost of producing all kinds of crafts is Rp. 8,080,000, - with a total of 87 days. This indicates more efficient results when compared with the cost of Rp. 12.6 50.000, - with a total of 115 days at Sumber Urip Ebony Store.Keywords : Assignments of Workers, Hungarian Method, Multi-objective Assignment, Optimize.
Penerapan Sistem Antrian Sebagai Upaya Mengoptimalkan Pelayanan Pembayaran Pajak Kendaraan Bermotor Di Kantor Samsat Kota Palu Serlyng; Jaya, A I; Sahari, A
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 16 No. 2 (2019)
Publisher : Program Studi Matematika, Universitas Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (652.35 KB) | DOI: 10.22487/2540766X.2019.v16.i2.14992

Abstract

ABSTRACTOne phenomenon that often occurs in daily life is a queue phenomenon. When queue is too long, it will harm the customer, therefore improving system servicing and optimizing the number of servers expected to reduce the queue, so the process of waiting does not happen too long. In the process of payment of motor vehicle tax at SAMSAT Palu City, it has been known that the queuing system using model Multi Channel- Multi Phase. Thissystem occurs if there are two or more facilities serving with services more than one phase. The ains of thisreseareh are to determine the characteristics of quene system and to know the number of person that required in the process of rehiele tax payment so that the service becomes optimal. The results stated that each phases of 1,2,3 and 4 is consist of 2 person, and motor vehicle tax payment servises in SAMSAT Palu is 108,9 minutes forone customer. Once optimized, an alternative solution to queue problem in SAMSAT Palu city is added person.The addition of 3 person at phase 1, 4 person phase 2, 5 person at phase 3 and phase 4. Will shorten the queuelength from (108,9) minutes to (29,76) minutes for one customer.Keywords : Model Multi Channel- Multi Phase, Samsat Queue.
Penentuan Rute Terpendek Pendistribusian Tabung Gas Lpg 3 Kg Pt. Fega Gas Palu Pratama Menggunakan Algoritma Tabu Search Riswan; Sahari, A; Lusiyanti, D
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 16 No. 2 (2019)
Publisher : Program Studi Matematika, Universitas Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (594.128 KB) | DOI: 10.22487/2540766X.2019.v16.i2.15004

Abstract

ABSTRACTDistribution is one of the important tools in the company business activities. The problem that is often occurred indistribution is the determination of the shortest route. The purpose of this study is optimitation distribution route of3 kg LPG gas cylinders which is carried out by PT. Fega Gas Palu Pratama in Palu City, considering that thiscompany has not used a particular method in determining the distribution route of 3 kg LPG gas cylinders. Themethod used in this study is the Tabu Search algorithm. The algorithm of the Tabu Search method are of follows,first by determine the initial solution using the closest Nearest Neighbor, determine alternatives by exchange 2points in the solution, evaluate alternative solutions, determine a new optimum solution, update the Tabu List, thenwhen the termination criteria are obtained then the Tabu Search algorithm will stop otherwise it will revert toexchanging 2 points evaluation. The process of calculating the Tabu Search algorithm is conducted manually andbuilt using MATLAB. Based on the research that has been done, it is obtained that the shortest, more efficient routeis 21.91 km which has reduction of 7.26 km from the initial route 29.17 km.Keywords : Algorithm Tabu Search, Distribution, Shortest Route.
Penyelesaian Vehicle Routing Problem Untuk Efisiensi Rute Pendistribusian Produk Minuman Teh Pucuk Harum Menggunakan metode Saving Matriks Studi Kasus (PT. Cipta Niaga Semesta Palu) Putrafi, R; Sahari, A
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 17 No. 1 (2020)
Publisher : Program Studi Matematika, Universitas Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (529.871 KB) | DOI: 10.22487/2540766X.2020.v17.i1.15164

Abstract

Vehicle Routing Problem Is a Problem related to the route of product distribution to the consumers. With the existence of these problems a company is expected to seek away a way so that the distribution process can arrive on time to scattered consumers and obtain more efficient routes and costs. Therefore a method which can help the process of scheduling a good route and obtaining optimum costs and efficient delivery was used. One of the methods used was Saving Matrix, which in its operation could efficient the delivery route so that the minimum total distance was obtained. The company's actual mileage was greater than the distance travelled by the route after using the Saving Matrix method. The total difference in distance produced was 106,35 km or more saving 41,2 % from the actual distance of the company and using Saving Matrix could save the distribution costs of Rp. 5.687.640 or save 33,8 % of the cost before applying the method.
Optimalisasi Persediaan Bahan Bakar Solar Pada PT. Macindo Mitra Raya Dengan Metode Economic Order Quantity (EOQ) Rizanjani, M E; Sahari, A; Andri
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 17 No. 1 (2020)
Publisher : Program Studi Matematika, Universitas Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22487/2540766X.2020.v17.i1.15172

Abstract

PT. Macindo Mitra Raya is a type of diesel oil (BBM) industrial company that supplies diesel fuel to full fill industrial nesercity, where one of the prices of diesel is the cost of inventory that needs to be managed. This study aims to determine the total cost of diesel fuel type inventories and determine the amount of stock of diesel fuel that is economical at PT. MACINDO MITRA RAYA through the Economic Order Quantity (EOQ) method. To calculation the number of economical orders, the formula √ 2𝐷𝑆 𝐻 is used. Then to determine the total fuel inventory cost, the formula √2𝐷𝑆𝐻 is used where D is the annual fuel order, S as the order ordering cost and H as the total ordering cost per message. From the results of the study indicate that the economical order for PT.Macindo Mitra Raya is 48,814.07 liters and the amount of inventory costs is Rp. 1,199,039,533. From the results obtained from the research conducted it has implications for the greatest efficiency in the cost of inventory of PT. Macindo Mitra Raya.
Implementasi Metode K-Nearest Neighbor Untuk Mengklasifikasi Jenis Penyakit Katarak Safaat, M; Sahari, A; Lusiyanti, D
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 17 No. 1 (2020)
Publisher : Program Studi Matematika, Universitas Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (599.389 KB) | DOI: 10.22487/2540766X.2020.v17.i1.15184

Abstract

The eyes is one of the five senses that are very important for humans that are used to see the beauty of nature and interact with the environment properly. If the eyes has a problems or diseases, it will be very severe. One of the disorders in the eye is cataract. Cataract if allowed, it will get worse for the sufferer. Therefore, the accuracy of determining the type and layout of early cataract is very important to prevent the more severe effects of cataract. One way to find out early on the type of cataract is by using the mathematical approach to data mining, namely the K-Nearest Neighbor (KNN) method. The concept of the KNN method is to find the nearest neighbor and choose the majority of the classes in the cluster. In this study, the system classified cataract types based on the symptoms experienced by cataract patients at Anutapura Palu Hospital whose research data was obtained from January 2018-March 2018 which amounted to 170 data. The results of this study indicate the accuracy of the KNN method for 170 data at 91.76% Keywords : Cataract, Classification, K-Nearest Neighbor (KNN)
Penentuan Jalur Terpendek Pendistribusian Barang Jalur Nugraha Ekakurir (JNE) Menggunakan Algoritma Semut (Studi Kasus JNE Dewi Sartika Palu) Musdalipa; Sahari, A; Najar, A M
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 18 No. 1 (2021)
Publisher : Program Studi Matematika, Universitas Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22487/2540766X.2021.v18.i1.15536

Abstract

Nowasday, it is often done traveling from one place or location to another by considering the path or the shortest route to be traveled. In determining the shortest route by implementing the ant algorithm to determine the shottest route. This case is a case of the traveling salesmen problem (TPS) namely visiting all location points starting from the starting point and ending at the starting point again. Case study in this research is delivery data of JNE courier palu. The sample used is 13 points which are then resolved using the ant algorithm adopts the ant work method to get the shortest route. The use of the ant algorithm in this case is limited to one cycle or one iteration (NC=1) so that the best route for the first cycle is obtained JNE Gudang utama dewi sartika palu( JNE jalan banteng No.8a biromaru palu selatan ( JNE basuki rahmat ( ), JNE jalan anoa No.107 pau selatan ( JNE diponegoro lere palu barat( JNE emysaelan No.20 palu selatan ( JNE sisingamangaraja palu ( JNE jalan kimaja palu barat ( ), JNE krajalemba No.7 sigi biromaru ( JNE jalan tombolotutu palu JNE samratulangi No.66 A palu ( ), JNE tondo kamus mantikulore ( JNE diponegoro lere palu barat ( anddcome back to JNE gudang utama dewi sartika palu ( ) with a distance of 56.4 km.