I Putu Susila Handika
Indonesian Institute of Business and Technology

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

Found 1 Documents
Search

Improving the Performance of the General Course Scheduling System at UPN Veteran Jawa Timur through the Application of the IWCFPSO Algorithm Made Hanindia Prami Swari; Chrystia Aji Putra; I Putu Susila Handika; Dwi Wahyuningtyas
Jurnal Nasional Pendidikan Teknik Informatika : JANAPATI Vol. 12 No. 3 (2023)
Publisher : Prodi Pendidikan Teknik Informatika Universitas Pendidikan Ganesha

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23887/janapati.v12i3.68128

Abstract

Algorithm selection is the main key in producing a system, especially an artificial intelligence-based system, for example, a course scheduling system that involves many constraints in producing an optimal schedule. This research develops a scheduling system using the ICWFPSO algorithm which is a development from previous research, namely the development of a scheduling system using the MIPSO algorithm. The use of inertia weight in the MIPSO algorithm which is used as a scheduling algorithm in previous research can be optimized by using a combination of inertia weight and constriction factor. Scheduling system development is carried out using the waterfall method with research steps namely problem and needs analysis, data collection and literature study, system design, system implementation, and ends with testing the performance of the algorithms that are applied to the scheduling system that is built. Based on the tests carried out, it can be concluded that the ICWFPSO algorithm provides 2 times better performance compared to the MIPSO algorithm in terms of optimal schedule generation time. Meanwhile, tests carried out on CPU and RAM usage showed that there was no significant impact on these two parameters through the implementation of MIPSO and ICWFPSO in the course scheduling system created. Keywords: best scheduling, ICWFPSO, number of iterations