MODIFIKASI ALGORITMA WELCH-POWELL UNTUK OPTIMALISASI PENJADWALAN UJIAN SKRIPSI

Abstrak

Thesis examination scheduling for final stage students is one of the issues that requires special attention for the scheduling official. Something similar is also a concern in the Department of Informatics, STMIK Amik Riau. Thesis examination scheduling research has been conducted at STMIK Amik Riau by utilizing graph node coloring techniques in the Welch-Powell algorithm. However, the use of the algorithm has not been maximized, where administrators are still needed to re-validate the schedule that has been processed using the algorithm. Based on this, it is felt necessary to continue previous research to solve the problems that are still being found so that the thesis examination scheduling application can be formed without overlapping exam schedules overlapping. This research still uses Welch-Powell algorithm, but it was modified to maximize the ability of the algorithm based on the needs of the thesis examination scheduling in the Department of Informatics, STMIK Amik Riau. Analysis and testing that has been carried out on 10 test participant data gives the result that as many as ten students can take the exam simultaneously which is divided into 4 test groups. This means that for the 10 students, the makers of the exam schedule only need to determine 4 exam times, without overlapping examinations based on the supervisor or examiner.