Optimasi Aplikasi Penjadwalan Kuliah Menggunakan Algoritma Genetik
Abstract
Course Scheduling is a routine activity at a college and it is a very important activity for the implementation of condusive academic activities. Problems that often occur in course scheduling are the length of the schedule making process and the clashes due to the many rules that must be considered. This problem happened in Indonesian Computer University at accounting major because the lecture scheduling process was still done conventionally. Given the importance of this scheduling process, optimization steps are needed so that the scheduling process will be faster and the schedule clashes can be minimized. Based on the problems, this research purpose is to optimize course scheduling application using genetic algorithm. The system approach method used in the development of course scheduling applications is object-oriented approach, with system development methods namely prototype models. to build the application we use the Java SE programming language with MySQL database. The conclusion of this study is that the implementation of genetic algorithms to course scheduling applications is able to achieve 0 (zero) clash which means very optimal, and view by time the result is very fast with an average of 1.003 seconds from 10 times the schedule creation attempt.
Downloads
References
[2] Josi, A. ,2017. Implementasi Algoritma Genetika Pada Aplikasi Penjadwalan Perkuliahan Berbasis Web Dengan Mengadopsi Model Waterfall, Jurnal Informatika: Jurnal Pengembangan IT, 02(02), hal. 77–83. doi: 10.30591/JPIT.V2I2.517.G554.
[3] Suyanto (2008) Evolutionary Computation Komputasi Berbasis Evolusi dan Genetika. Bandung: Informatika.
[4] Budhi, R. ,2008. Aplikasi Algoritma Genetik Untuk Optimasi Penjadwalan Kegiatan Perkuliahan, Transformatika, 6(1), hal. 1–8. doi: 10.26623/Transformatika.V6I1.32.
[5] Haryadi, D. dan Jamal, A. ,2015. Preferensi Dosen Pada Proses Penjadwalan Kuliah Menggunakan Algoritma Genetik Studi Kasus: Universitas Al Azhar Indonesia, Jurnal Al-Azhar Indonesia Seri Sains Dan Teknologi, 3(2), hal. 91–97. Tersedia pada: http://jurnal.uai.ac.id/index.php/SST/article/view/191 (Diakses: 30 Juli 2018).
[6] Radliya, N. R. ,2014. Pemodelan Sistem Penjadwalan Perkuliahan Menggunakan Algoritma Genetika, Jamika, 1(12), hal. 19–28.
[7] Lestari, U., Widyastuti, N. dan Listyaningrum, D. A. ,2014. Implementasi Algoritma Genetika Pada Penjadwalan Perkuliahan, Prosiding Seminar Nasional Aplikasi Sains & Teknologi (SNAST) 2014, Yogyakarta (November), hal. 211–216.
[8] Yaqin, M. A. dan Lisbiantoro, T. ,2012. Optimasi Penjadwalan Perkuliahan Jurusan Teknik Informatika Universitas Islam Negeri Maulana Malik Ibrahim Malang Menggunakan Algoritma Genetika dengan Metode Seleksi Rank, MATICS Jurnal Ilmu Komputer dan Teknologi Informasi, 4(5), hal. 191–196. doi: 10.18860/mat.v0i0.2003.
[9] Ikbal, I. dan Mauluddin, S. ,2018. Classroom Booking Information System Integrated with Course Scheduling Information System, in IOP Conference Series: Materials Science and Engineering. IOP Publishing, hal. 1–6. doi: 10.1088/1757-899X/407/1/012163.
[10] Soenandi, I. A. ,2013. Konsep algoritma genetik biner untuk optimasi perencanaan jadwal kegiatan perkuliahan (, Jurnal Teknik dan Ilmu Komputer, 02(07), hal. 355–362.
Copyright (c) 2018 Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)

This work is licensed under a Creative Commons Attribution 4.0 International License.
Copyright in each article belongs to the author
- The author acknowledges that the RESTI Journal (System Engineering and Information Technology) is the first publisher to publish with a license Creative Commons Attribution 4.0 International License.
- Authors can enter writing separately, arrange the non-exclusive distribution of manuscripts that have been published in this journal into other versions (eg sent to the author's institutional repository, publication in a book, etc.), by acknowledging that the manuscript has been published for the first time in the RESTI (Rekayasa Sistem dan Teknologi Informasi) journal ;