Penjadwalan Perkuliahan Dengan Metode Vertex Graph Coloring Dan Simulated Annealing

Abstract

<p><em>In college, lecture scheduling is very important in lecturing process, because the activities of lecturers and students depend on lecture schedule. To solve the problem, use Vertex GraphColoring and Simulated Annealing. In Vertex Graph Coloring, look for neighboring and neighboring vertices. While on Simulated Annealing, look for space and exchange positions randomly. The merger of Vertex Graph Coloring and Simulated Annealing aims to create optimum lecture schedule by looking at hard constraint and soft constraint. Testing is done at Faculty of Pharmacy University of North Sumatra, by making schedule from manual to computerized, so it is expected to make the schedule optimally and able to avoid hardconstaint and soft constraint.</em></p>

Perbandingan Algoritma Welch Powell dan Algoritma Greedy dalam Optimasi Penjadwalan Ruang Kuliah Semester Genap Fakultas Teknik

“…Dalam dunia pendidikan, penjadwalan biasa diterapkan untuk menyusun jadwal pembelajaran/perkuliahan yang harus dibuat setiap semester, jadwal kuis, jadwal ujian semester, ujian skripsi, jadwal mengajar dosen, dan lain sebagainya. Dalam menyusun penjadwalan perkuliahan, komponen-komponen utama yang diperlukan ialah mata kuliah, dosen, mahasiswa, waktu, serta ruang kelas [2]. Menyusun penjadwalan bukanlah hal yang mudah, penyusun seringkali dihadapkan pada beberapa kendala.…”