Open AccessLecture Scheduling System Using Welch Powell Graph Coloring Algorithm in Informatics Engineering Departement of Universitas Malikussaleh
Author(s) -
Dahlan Abdullah,
Nurdin Nurdin,
Marsali Yaton,
Heri Sujatmiko,
Sepyan Purnama Kristanto,
Hendra Nazmi,
Irma Lisa Sridanti,
Andang Suhendi,
Abdurrozzaq Hasibuan,
Renny Kurniawati,
Darmadi Erwin Harahap,
Hendry Dinus Hutabarat,
I Ketut Sudarsana
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1363/1/012074
Subject(s) - graph coloring , computer science , schedule , scheduling (production processes) , informatics , greedy coloring , graph , operations research , mathematical optimization , theoretical computer science , mathematics , engineering , graph power , operating system , line graph , electrical engineering
Scheduling lectures is a routine work in the academic system in higher education every time to facing a new semester. In the implementation, often the schedule that has been issued has not been fixed so it requires to rescheduling. For this reason, a new lecture scheduling system is needed using the Welch Powell Graph Coloring Algorithm. This study was done in the Informatics Engineering Departement of Universitas Malikussaleh using the subjects schedule during 2013, 2014 and 2015. Based on the results of this study it can be concluded that the Welch Powell Graph Coloring Algorithm can solve properly the problem of scheduling lectures, in this case there are no clashes between scheduled components.