Lecture Scheduling System Using Welch Powell Graph Coloring Algorithm in Informatics Engineering Departement of Universitas Malikussaleh

Abdullah, Dahlan; Nurdin, Nurdin; Yaton, Marsali; Sujatmiko, Heri; Kristanto, Sepyan Purnama; Nazmi, Hendra; Sridanti, Irma Lisa; Suhendi, Andang; Hasibuan, Abdurrozzaq; Kurniawati, Renny; Harahap, Darmadi Erwin; Hutabarat, Hendry Dinus; Sudarsana, I Ketut

doi:10.1088/1742-6596/1363/1/012074

Cited by 6 publications

(4 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Abdullah et al, [45] presented the Welch Powell Graph Colouring Algorithm to develop an efficient lecture scheduling system. The study demonstrated using multiple years of datasets from Universitas Malikussaleh concluded that it successfully resolves lecture scheduling problems by preventing scheduling conflicts.…”

Section: Heuristicmentioning

confidence: 99%

Optimization in University Student Timetables: A Comprehensive Literature Review

Farradini Zabidee,

Muhamad Hariz Muhamad Adnan

2024

ARASET

View full text Add to dashboard Cite

The University Course Timetabling Problem presents a complex optimization problem as it seeks to meet the diverse requirements and constraints of a university's academic program through efficient timetabling. The objective of this research is to conduct comprehensive review of existing studies on optimization approaches in optimizing university timetable problems. The aim of the comprehensive studies is to further analyse the existing studies to discuss comparative studies to compare the performance of the approach methods in satisfying the constraints involved in university timetabling. The methodology used for this paper is systematic literature review which brought three main themes such constraints, optimization approaches, and datasets involved in University Course Timetabling Problem. The result shown that the majority of approaches involved hybrid approaches. In conclusion, this comprehensive review summarizes the constraints, optimization approach and datasets involved University Course Timetabling Problem in higher educational institutions of ASEAN countries.

show abstract

Section: Heuristicmentioning

confidence: 99%

Optimization in University Student Timetables: A Comprehensive Literature Review

Farradini Zabidee,

Muhamad Hariz Muhamad Adnan

2024

ARASET

View full text Add to dashboard Cite

show abstract

“…The Greddy algorithm includes the Welch Powell algorithm (Lewis, 2021) and (Hazizah et al, 2023), when the Kruskal's Hendra Cipta, Rina Widyasari, Fikri Husin Batubara algorithm and the Prims algorithm are available in addition to the Welch Powell algorithm (Cipta & Widyasari, 2020). The steps for coloring using the Welch Powell algorithm are as follows (Ganguli & Roy, 2017) and (Abdullah et al, 2019):…”

Section: Coloring Graph Algorithmmentioning

confidence: 99%

Graph Coloring Implementation Using Welch Powell Algorithm In Lecture Scheduling Design For Mathmatics Department

Cipta,

Widyasari,

Batubara

2023

Mathline

View full text Add to dashboard Cite

Designing the scheduling of lecture rosters is one of the common problems faced by all universities. The problem that often occurs as a conflict in the lecture schedule. Lecturers who teach courses, students cannot take certain courses because the lecture schedule they are taking conflicts with other lecture schedules. The main problem in this research is the design of lecture schedules which always conflict due to room availability and lecturer teaching hours. As a result, lecture scheduling becomes more complicated. The case study used is the scheduling of lectures for the Mathematics Department, Faculty of Science and Technology, UIN Sumatera Utara, Medan in the even semester of the 2022/2023 academic year. In this research, a bipartition graph will be formed based on the variables used, namely determining the variable index used in the course, teaching lecturer, teaching time, entry time, exit time, classroom, number of credits, semester and color. After that, the Welch Powell Algorithm will be used to solve the scheduling problem of a bipartition graph which is formed by creating nodes, membership matrix and the final result is a tabulation of the colored bipartition graph as the output of the scheduling. This algorithm also uses MATLAB software. From the results obtained, the algorithm provides an effective digital solution in designing lecture roster scheduling which is still done manually. This will help the mathematics department in overcoming the problems mentioned above. The research results will be explained detail in the results and discussion section.

show abstract

“…Besides that, there are several other studies that have been conducted by researchers including, research Lecture Scheduling System Using Welch Powell Graph Coloring Algorithm in Informatics Engineering Departement of Universitas Malikussaleh (Abdullah et al, 2019), Mixed integer linear programming model for integrated fish supply chain planning (Nurdin et al, 2020), Robust optimization approach for agricultural commodity supply chain planning , Data Driven Optimization Approach to Fish Resources Supply Chain Planning in Aceh Province (Nurdin et al, 2019) Optimization and Computing Model of Fish Resource Supply Chain Distribution Network and Implementation of the BFS algorithm and web scraping techniques for online shop detection in Indonesia (Nurdin, Bustami et al, 2021).…”

Section: Introductionmentioning

confidence: 99%

Application of the K-Means Clustering Algorithm to Determine Student Academic Ability Levels during Covid-19

Bustami,

Nurdin,

Taufiq

et al. 2023

J. Adv. Zool.

View full text Add to dashboard Cite

Since the existence of the COVID-19 pandemic in Indonesia, various ways and efforts have been made by the government to prevent the spread of the corona virus. One of them is by implementing an online learning system, so that it causes differences in the learning process that is usually carried out by lecturer face to face with students. Changes in the learning process are expected to be carried out effectively and efficiently. The purpose of this research is to find out how the level of students' academic ability is during online learning in the Informatics Engineering study program at Universitas Malikussaleh and aims to produce a system model that can cluster the level of student academic ability using the K-Means Clustering Algorithm. The variables used in this study are 3 parameters, namely the teaching and learning process, facilities and infrastructure and learning outcomes. The stages carried out in this study were collecting questionnaire data filled out by 200 students. The data obtained would be processed using the K-Means Clustering Algorithm and forming 3 clusters, namely low, medium and high. The clustering results of 200 data obtained 27 students having low academic ability levels (Cluster 1), 87 students having moderate academic ability levels (Cluster 2) and as many as 86 students having high academic ability levels (Cluster 3). The contribution of this research is to help the management of the Informatics Engineering Study Program at Universitas Malikussaleh to find out how the level of student academic ability is during the online learning period during the COVID-19 pandemic, so that evaluation of learning can be carried out online.

show abstract

Lecture Scheduling System Using Welch Powell Graph Coloring Algorithm in Informatics Engineering Departement of Universitas Malikussaleh

Cited by 6 publications

References 1 publication

Optimization in University Student Timetables: A Comprehensive Literature Review

Optimization in University Student Timetables: A Comprehensive Literature Review

Graph Coloring Implementation Using Welch Powell Algorithm In Lecture Scheduling Design For Mathmatics Department

Application of the K-Means Clustering Algorithm to Determine Student Academic Ability Levels during Covid-19

Contact Info

Product

Resources

About