Badr Khaerudin
Indraprasta Pgri University

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

Found 1 Documents
Search

Sistem Seleksi Penerimaan Karyawan Baru di PT Ilmukomputercom Braindevs Sistema Menggunakan Metode Profile Matching Badr Khaerudin; Rayung Wulan
Jurnal Riset dan Aplikasi Mahasiswa Informatika (JRAMI) Vol. 7 No. 04 (2026): Jurnal Riset dan Aplikasi Mahasiswa Informatika (JRAMI)
Publisher : Program Studi Teknik Informatika, FTIK, Universitas Indraprasta PGRI

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30998/jrami.v7i04.2033

Abstract

The selection process for new employee recruitment at PT IlmuKomputerCom Braindevs Sistema is still conducted by reviewing application documents and paper curriculum vitae (CVs) one by one by HR personnel and relying on recommendations from partner schools. The number of applicants increased almost threefold, from 36 people in 2021 to 104 people in 2025, making the mechanism time-consuming and vulnerable to subjective assessment. This research aims to design and build a web-based new employee recruitment selection system application using the Profile Matching method. The system development was carried out using the waterfall model SDLC approach, with data collection through literature study, observation, and interviews with the HRD. The profile matching method was applied by comparing the applicants' scores against the company's ideal profile in three assessment aspects: administrative aspects, interview results, and skills covering nine criteria. The difference (gap) is converted into weights, grouped into core factors (60%) and secondary factors (40%), and then accumulated into a final score with inter-aspect weights of 35%, 25%, and 40%. Testing on five samples of programme position candidates resulted in a final ranking with the highest score of 3.52. The research results indicate that the developed system is capable of making the selection process more efficient, objective, and measurable