Article Per Year (5 Year)
p-Index From 2020 - 2025
0.408
P-Index
This Author published in this journals
All Journal TEKNIK INFORMATIKA Techno Nusa Mandiri : Journal of Computing and Information Technology
Sri Rahayu
Sekolah Tinggi Manajemen Informatika dan Komputer Nusa Mandiri
Computer Science & IT

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

Found 2 Documents
Search

 1 
PENERAPAN ALGORITMA DIJKSTRA DALAM PENENTUAN LINTASAN TERPENDEK MENUJU UPT. PUSKESMAS CILODONG KOTA DEPOK Cicih Sri Rahayu; Windu Gata; Sri Rahayu; Agus Salim; Arif Budiarto
JURNAL TEKNIK INFORMATIKA Vol 14, No 1 (2021): JURNAL TEKNIK INFORMATIKA
Publisher : Department of Informatics, Universitas Islam Negeri Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/jti.v14i1.18721

Abstract

One of the government's efforts in providing health to the community is the construction of health centers in each sub-district, and the community is expected to be able to take advantage of the health facilities provided by the government. One of the problems that exist in the community is determining the shortest distance to the puskesmas. In Depok City, there are 26 routes that can be passed from the 38 nodes or vertices to the Cilodong Health Center with the starting point of the Depok mayor's office. This study uses a survey research method to calculate the actual distance at each node or vertex, the purpose of this study is to determine the shortest path taken by the starting point from the Depok mayor's office to get to the Cilodong Health Center by applying the dijkstra algorithm. This dijkstra algorithm works by visiting all existing points and making a route if there are 2 routes to the same 1 point then the route that has the lowest weight is chosen so that all points have an optimal route. This quest continues until the final destination point. After doing this research and testing using a simple application to calculate the distance by applying the djikstra algorithm, it was found that the shortest path taken to the destination is through the GDC Main Gate or on the test results in Iteration 26. From the results of this study, people can choose this closest route to save time when viewed from the distance of the existing track. For further research, it is expected to be able to compare two other algorithms and other parameters so that the closest route with the fastest time is obtained.
GARMENT EMPLOYEE PRODUCTIVITY PREDICTION USING RANDOM FOREST Imanuel Balla; Sri Rahayu; Jajang Jaya Purnama
Jurnal Techno Nusa Mandiri Vol 18 No 1 (2021): Techno Nusa Mandiri : Journal of Computing and Information Technology Period of
Publisher : Lembaga Penelitian dan Pengabdian Pada Masyarakat

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33480/techno.v18i1.2210

Abstract

Clothing also means clothing is needed by humans. Besides the need for clothing in terms of function, clothing sales or business is also very potent. About 75 million people worldwide are directly involved in textiles, clothing, and footwear. In this case, a common problem in this industry is that the actual productivity of apparel employees sometimes fails to reach the productivity targets set by the authorities to meet production targets on time, resulting in huge losses. Experiments were conducted using the random forest model, linear regression, and neural network by looking for the values ​​of the correlation coefficient, MAE, and RMSE. This aims to predict the productivity of garment employees with data mining techniques that apply machine learning and look for the minimum MAE value. The results of testing the proposed algorithm on the garment worker productivity dataset obtained the smallest MAE, namely the random forest algorithm, namely 0.0787, linear regression 0.1081, and 0.1218 neural networks
Co-Authors Agus Salim Arif Budiarto Cicih Sri Rahayu Imanuel Balla Jajang Jaya Purnama Windu Gata