ROOM OPTIMIZATION IN COURSE SCHEDULING USING THE GREEDY ALGORITHM
Article Sidebar
Main Article Content
Abstract
Greedy algorithm is an algorithm that solves problems with systematic steps. In this research, the optimization used is the use of existing rooms on the AMIK Medicom Medan campus. The problem that often occurs on campus is the scheduling of courses with limited space. With these problems, it can hamper various other activities and the time needed is quite long to arrange a schedule because it is done manually. The purpose of this research is to test the greedy algorithm in optimizing empty spaces in the manufacture of the Course Scheduling System and to compare the algorithm testing with manuals. The application of the algorithm to the system will produce an effective course schedule without any problems in the use of the room so that there is no simultaneous use of the room in other courses.
Downloads
Article Details
Angga, C. &. (2012). Pengembangan Algoritma Greedy untuk Optimalisasi Penataan Peti Kemas Pada Kapal Pengangku. Jurnal Sarjana Institut Teknologi Bandung bidang Teknik Elektro dan Informatika.
Baker, K. (1974). Introduction To Sequencing and Scheduling . New York: Jhon Willey and Sons.
Furqan, M. (2019). Algoritma Hibrida Metode Heuristik Dan Eksak Untuk .
Insani, N. F. (2016). Perancangan Aplikasi Pencarian Hotel . Kota Bandung Jurnal.
J.E., B. D. (1987). Integrated Production Control System. New York: John Wiley & Sons.
Juniar, A. (2015). Penerapan Algoritma Greedy pada Penjadwalan Produksi Single-Stage dengan Parallel Machine di Industri Konveksi. Jakarta.
K, W. A. (2007). Perbandingan Kompleksitas Penerapan Algoritma Greedy untuk Beberapa Masalah. Institut Teknologi Bandung.
Lemos, F. S. (2019). Room usage optimization in timetabling: A case study at Universidade de Lisboa. Oper. Res. Perspect.
Maulana, G. G. (2017). Pembelajaran Dasar Algoritma Dan Pemrograman 75 Menggunakan El-Goritma Berbasis Web. Jurnal Teknik Mesin, 8.
Munir, R. (2009). Diklat Kuliah: Strategi Algoritma. Bandung: Penerbit ITB.
Sabaruddin, R. (2016). Solusi Optimum Minmax 0/1 Knapsack Menggunakan Algoritma Greedy. Jurnal Evolusi, 5–24.
T. Sunarni, R. B. (2018). Penerapan Teknik Pewarnaan Simpul Graf Pada Permasalahan Penjadwalan Kuliah. . Pros. Ritektra, 84-91.
V, S. (2005). KNAPSACK 0-1 PROBLEM. ISBN : 3-540-40286-1.
Y. Sari, M. A. (2019). Optimasi Penjadwalan Mata Kuliah Menggunakan Metode Algoritma Genetika dengan Teknik Tournament Selection. J. Teknol. Inf. dan Ilmu Komput, 85.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.