Schedule Implementing the Modified Euclidean Distance Method in the Course Planning of the USN Kolaka Information Systems Curriculum

Muh Nurtanzis  Sutoyo; Andi Tenri  Sumpala Mangkona

doi:10.25299/itjrd.2022.7976

Authors

Muh Nurtanzis Sutoyo Faculty of Information Technology, Sembilanbelas November Kolaka University
Andi Tenri Sumpala Mangkona Faculty of Information Technology, Sembilanbelas November Kolaka University

DOI:

https://doi.org/10.25299/itjrd.2022.7976

Keywords:

Scheduling, Euclidean Distance, Algorithm

Abstract

Scheduling is needed to anticipate the clash of lecture hours for lecturers in teaching. Some things that need to be considered when arranging a lecture schedule are lecturers, rooms, courses, hours, and days. In this study, the scheduling system uses the Euclidean Distance method by modifying the algorithm. The aim of this study is to prove the Euclidean distance method in the course planning system in universities. In general, to obtain data that will be used in the scheduling system, observations, interviews and bibliographic studies are carried out. From the research results, the lecture scheduling system using the Euclidean Distance method can be used in the scheduling system, especially lecture scheduling. This is proven, that the lecture scheduling system using the Euclidean Distance method does not have a schedule for lecturers who teach more than one course at the same time (collide).

Downloads

Download data is not yet available.

References

Y. Sari, M. Alkaff, E. S. Wijaya, S. Soraya, and D. P. Kartikasari, “Optimasi Penjadwalan Mata Kuliah Menggunakan Metode Algoritma Genetika dengan Teknik Tournament Selection,” J. Teknol. Inf. dan Ilmu Komput., vol. 6, no. 1, p. 85, 2019, doi: 10.25126/jtiik.2019611262.

M. T. Rustiyana and R. Budiman, “Aplikasi Penjadwalan Kuliah Dengan Menerapkan Metode Algoritma Steepest-Ascent Hill Climbing Di Fakultas Teknologi Informasi Universitas Bale Bandung,” Computing, vol. 6, no. 2, pp. 1–9, 2019, [Online]. Available: http://ejournal.unibba.ac.id/index.php/computing/article/view/189.

Mansur, “Perancangan Sistem Informasi Penjadwalan Resource Perguruan Tinggi Menggunakan Metode Particle Swarm Optimization (PSO),” Invotek, vol. 4, pp. 75–86, 2014.

Selviyanti, M. S. Lamada, and S. G. Zain, “Sistem penjadwalan mata kuliah pada jurusan pendidikan teknik elektro fakultas teknik universitas negeri makassar menggunakan php,” vol. 17, no. 3, pp. 49–54, 2020.

A. Laksono, M. Utami, and Y. Sugiarti, “Sistem Penjadwalan Kuliah Menggunakan Metode Algoritma Genetika (Studi Kasus: Fakultas Kedokteran dan Kesehatan Universitas Muhammadiyah Jakarta),” Stud. Inform. J. Sist. Inf., vol. 9, no. 2, pp. 177–188, 2018.

V. U. R. Hartadi, A. Hidayat, “Perancangan Aplikasi Penjadwalan Mata Kuliah (Studi Kasus : STMIK Provisi Semarang),” Pro HTML5 with CSS, JavaScript, Multimed., vol. 4, no. 1, pp. 439–466, 2017, doi: 10.1007/978-1-4842-2463-2_24.

A. Hanafiah, “Implementasi Load Balancing Dengan Algoritma Penjadwalan Weighted Round Robin Dalam Mengatasi Beban Webserver,” IT J. Res. Dev., vol. 5, no. 2, pp. 226–233, 2021, doi: 10.25299/itjrd.2021.vol5(2).5795.

L. Paranduk, A. Indriani, M. Hafid, and Suprianto, “Sistem Informasi Penjadwalan Mata Kuliah Menggunakan Algoritma Genetika Berbasis Web,” Semin. Nas. Apl. Teknol. Inf., pp. E46–E50, 2018.

Fitriyani, R. Fitriani, and N. Rosmawanti, “Penerapan Algoritma Euclidean Distance Untuk Pemilihan Paket Internet Berdasarkan Wilayah,” Progresif, vol. 13, no. 1, pp. 1651–1662, 2017.

R. K. Dinata, H. Akbar, and N. Hasdyna, “Algoritma K-Nearest Neighbor dengan Euclidean Distance dan Manhattan Distance untuk Klasifikasi Transportasi Bus,” Ilk. J. Ilm., vol. 12, no. 2, pp. 104–111, 2020, doi: 10.33096/ilkom.v12i2.539.104-111.

H. R. Siburian, E. Buulolo, and H. Hutabarat, “Algoritma K-Nearest Neigbor Model Euclidean Distance Dalam Klasifikasi Kelulusan Peserta Bahasa Indonesia Penutur Asing Pada Balai Bahasa Sumatera Utara,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 3, no. 1, pp. 171–175, 2019, doi: 10.30865/komik.v3i1.1585.

A. Pratidina, “Implementasi Pengolahan Citra Untuk Mendapatkan Informasi Mengenai Citra Baret TNI Dengan Menggunakan Algoritma Euclidean Distance,” vol. 22, no. 1, 2017.

Y. Yuliska and K. U. Syaliman, “Peningkatan Akurasi K-Nearest Neighbor Pada Data Index Standar Pencemaran Udara Kota Pekanbaru,” IT J. Res. Dev., vol. 5, no. 1, pp. 11–18, 2020, doi: 10.25299/itjrd.2020.vol5(1).4680.

R. M. Candra and A. Nanda Rozana, “Klasifikasi Komentar Bullying pada Instagram Menggunakan Metode K-Nearest Neighbor,” IT J. Res. Dev., vol. 5, no. 1, pp. 45–52, 2020, doi: 10.25299/itjrd.2020.vol5(1).4962.

A. Yudhana, S. Sunardi, and A. J. S. Hartanta, “Algoritma K-Nn Dengan Euclidean Distance Untuk Prediksi Hasil Penggergajian Kayu Sengon,” Transmisi, vol. 22, no. 4, pp. 123–129, 2020, doi: 10.14710/transmisi.22.4.123-129.

Suparmi and Soeheri, “Application of the Euclidean Distance Nearest Location Method Campus Area Boarding School,” pp. 105–113, 2020.

D. Harto and M. Z. Rahmani, “Sistem Pengenalan Wajah Dengan Metode Euclidean Distance,” J. Elektr. Borneo, vol. 5, no. 2, pp. 16–26, 2019.

R. Rizaldi, A. Kurniawati, and C. V. Angkoso, “Implementasi Metode Euclidean Distance untuk Rekomendasi Ukuran Pakaian pada Aplikasi Ruang Ganti Virtual,” J. Teknol. Inf. dan Ilmu Komput., vol. 5, no. 2, p. 129, 2018, doi: 10.25126/jtiik.201852592.

S. Mulyati, S. M. Husein, and Ramdhan, “Rancang Bangun Aplikasi Data Mining Prediksi Kelulusan Ujian Nasional Menggunakan Algoritma KNN dan Metode Euclidean Distance,” J. Tek. Inform. Univ. Muhammadiyah Tangerang, vol. 4, no. 1, pp. 65–73, 2020.

P. Y. Santoso and D. Kusumaningsih, “Algoritma K-nearest Neighbor Dengan Menggunakan Metode Euclidean Distance Untuk Memprediksi Kelulusan Ujian Nasional Berbasis Desktop SMA Negeri 12 Tangerang.,” Skanika 2018, vol. 1, no. 1, pp. 123–129, 2018.