IMPLEMENTASI ALGORITMA GREEDY MATCHING PADA SISTEM REKOMENDASI JASA TUKANG BANGUNAN
DOI:
https://doi.org/10.37859/seis.v6i2.10848
Abstract
The small-scale construction industry in Warnasari District, Brebes Regency, still faces inefficiencies in finding daily construction workers because the recruitment process is commonly carried out through gathering points and word-of-mouth information. This condition creates income uncertainty for workers and makes it difficult for employers to assess workers’ skills, location, and reputation. This study aims to develop a web-based recommendation system for construction worker services by implementing the Greedy Matching algorithm. The main contribution of this research is the application of weighted matching based on skill, location distance, and performance rating criteria to generate fast and measurable worker recommendations. The system was developed using the Rapid Application Development (RAD) method, while the recommendation process was carried out by calculating the heuristic value of each candidate and selecting the candidate with the highest score as a local optimal solution. The evaluation was conducted through Black Box testing to assess the validity of system functions and a Greedy Matching calculation simulation to evaluate the candidate ranking output. The test results showed that all system features functioned validly with a success rate of 100%. The calculation simulation results showed that the candidate with a score of 97.0 was placed in the first position compared to another candidate with a score of 74.0. These results indicate that the system is able to generate measurable construction worker service recommendations based on the applied weighted criteria.
Downloads
References
Ali Fikri, M., Lubis Ghozali, A., & Aldi Wibowo, I. (2025). Sistem Rekomendasi Pencarian Kerja dengan Metode Simple Additive Weighting Berbasis Website: Studi Kasus SMKN 1 Terisi. 11(3). https://doi.org/10.31884/jtt.v11i3.1142
Angul, A., Fallo, D., Tanggo, K. V., Belo Alves Nazario, I., & Hoar, F. (2025). Implementasi Algoritma Dijkstra dan Greedy dalam Penyelesaian Masalah Rute Terpendek. Jurnal Kridatama Sains Dan Teknologi, 7(1), 489–496.
Fulber-Garcia, V., Camargo, F. E., & Duarte, E. P. (2022). Sk-Greedy: A Heuristic Scheduling Algorithm for Wireless Networks under the SINR Model. ACM International Conference Proceeding Series, 143–148. https://doi.org/10.1145/3569902.3570190
Gracia Sembiring, F., Putri Syaifullah Nst, S., Shaleh Lbn Gaol, A., & Harliana, P. (2025). IMPLEMENTASI ALGORITMA GREEDY DALAM PENENTUAN JALUR STRATEGIS DARI SIMPANG POS KE LAPANGAN MERDEKA KOTA MEDAN. In Jurnal Mahasiswa Teknik Informatika) (Vol. 9, Number 1).
Hatmara Sukma, S., Suarna, N., Bahtiar, A., Pramudya Marta, P., & Anam, K. (2026). MODEL PREDIKSI PENERIMA BANTUAN SOSIAL BERBASIS ALGORITMA RANDOM FOREST. 6(1), 45–49.
Komen, J. J., Belitser, S. V., Wyss, R., Schneeweiss, S., Taams, A. C., Pajouheshnia, R., Forslund, T., & Klungel, O. H. (2021). Greedy caliper propensity score matching can yield variable estimates of the treatment-outcome association—A simulation study. Pharmacoepidemiology and Drug Safety, 30(7), 934–951. https://doi.org/10.1002/pds.5232
Mergawy, R. T., Hosny, H. E., & Abdelazeem, A. S. (2023). Decision Support Model for Contractor Selection. The Open Civil Engineering Journal, 17(1). https://doi.org/10.2174/18741495-v17-e230215-2022-51
Rahmawan, A., Ramdhani, L., & Baha’udin. (2022). IMPLEMENTASI ALGORITMA GREEDY UNTUK PENENTUAN PRIORITAS LOKASI WISATA BERDASARKAN JARAK TERDEKAT. INFOTIKA: Jurnal Pendidikan Informatika, 1(1). https://jurnal.habi.ac.id/index.php/Info
Sahnoun, I., & Elhadjamor, E. A. (2024). Enhanced Freelance Matching: Integrated Data Analysis and Machine Learning Techniques. Journal of Computing Theories and Applications, 1(4), 507–517. https://doi.org/10.62411/jcta.10152
Saktia Purnama, R. D., Nisa, F., Tundo, T., Nurohman, K., Fakhrurrofi, F., Nugrahaini, L., & Dalail, D. (2024). IMPLEMENTASI PENGGUNAAN ALGORITMA GREEDY BEST FIRST SEARCH UNTUK MENENTUKAN RUTE TERPENDEK DARI CILACAP KE YOGYAKARTA. Jurnal Informatika Dan Teknik Elektro Terapan, 12(2). https://doi.org/10.23960/jitet.v12i2.4068
Sunanto, & Abadi Faural. (2021). OPTIMASI PENGATURAN STEAM UAP MENGGUNAKAN ALGORITMA GREEDY UNTUK MENDUKUNG PROSES PEREBUSAN KELAPA SAWIT. Journal of Software Engineering and Information System (SEIS), 1(1), 30–35. https://doi.org/10.37859/seis.v1i1.2815
Titasari Br Bangun, E., Arvia Luthfi, F., Sukesi, R., Arlen, Mr., Asral, Mz., Mikhraj, U., & Aulia, V. (2026). PERANCANGAN SISTEM INFORMASI LAYANAN SERVICE AC PADA PT.TEKNINDO ABADI PRATAMA BERBASIS WEB. 6(1). https://ejurnal.umri.ac.id/index.php/SEIS/index
Vente, T., Mehta, Z., Wegmeth, L., & Beel, J. (2022). Greedy Ensemble Selection for Top-N Recommendations. 3924, 12–16.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Rosidin; Misbahus Sudur, Raditya Danar Dana, Ratna Dewi Lestyorini, Sukarsa

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Copyright Notice
An author who publishes in the Journal of Software Engineering and Information System (SEIS) agrees to the following terms:
- Author retains the copyright and grants the journal the right of first publication of the work simultaneously licensed under the Creative Commons Attribution-ShareAlike 4.0 License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Author is able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book) with the acknowledgement of its initial publication in this journal.
- Author is permitted and encouraged to post his/her work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of the published work (See The Effect of Open Access).
Read more about the Creative Commons Attribution-ShareAlike 4.0 Licence here: https://creativecommons.org/licenses/by-sa/4.0/.
