Analysis of the Use of Backtracking Algorithm in Course Scheduling

Authors

  • Surizky Ananda State Islamic University of North Sumatra (UIN North Sumatra)
  • M. Khalil Gibran State Islamic University of North Sumatra (UIN North Sumatra)
  • Fajar Syakbani State Islamic University of North Sumatra (UIN North Sumatra)
  • Maria Ulfa State Islamic University of North Sumatra (UIN North Sumatra)
  • Maya Sari Hasibuan State Islamic University of North Sumatra (UIN North Sumatra)

DOI:

https://doi.org/10.59934/jaiea.v4i3.1161

Keywords:

Graphic Visualization; NetworkX; Matplotlib; Lecturer, Class; Backtracking Algorithm; CSP; Course Scheduling

Abstract

In a university study program, course scheduling is an essential procedure to guarantee the effective use of resources, including lecturers and classrooms. The goal of this study is to examine how the Constraint Satisfaction Problem (CSP) Method and the Backtracking Algorithm are used in the scheduling of courses in the State Islamic University of North Sumatra's Computer Science Study Program. Through the assignment of courses to the appropriate time slots, classrooms, and lecturers, this study seeks to maximize the timetable while meeting predefined limits. such include the length of the course, the availability of lecturers, and the size of the classroom.The NetworkX library is used to show the graph-based approach that is being used. utilizing the NetworkX library, in which classrooms, lecturers, and courses are represented by vertices, and the connections between them are represented by edges. The technique By removing incompatible scheduling configurations, this technique effectively lowers the quantity of erroneous configurations. The findings of the study demonstrate that a workable and ideal schedule that minimizes conflicts and satisfies all requirements may be created by employing CSP and backtracking. disputes. This study offers a possible model and advances knowledge of the practical applications of computing techniques like CSP and backtracking in scheduling issues.

Downloads

Download data is not yet available.

References

Abidin, M. Z., Wiranto, & Setiadi, H. (2019). Course scheduling using dynamic-order backjumping (Case study: STIKA Madiun). ITSMART, 7(2), 101-107.

Adiguna, Y., & Swanjaya, D. (2020). Implementasi algoritma backtracking untuk mencari jalan keluar labirin. Dalam Sucipto (Ed.), Pengembangan sains dan teknologi untuk pembangunan yang berkelanjutan (Prosiding SEMNAS INOTEK, 4(3), 131-136). Kediri: Prosiding SEMNAS INOTEK.

Ferdinal, R. (2021). Penerapan algoritma backtracking dan metode constraint satisfaction untuk penjadwalan. Ginsberg, M. L. (2020). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25-46.

Handayani, D., Rosely, E., & Mayadewi, R. P. (2016). Aplikasi penjadwalan mata pelajaran dengan pewarnaan graf menggunakan algoritma Welch-Powell studi kasus: X MIPA SMA Negeri 8 Bandung. E-Proceeding of Applied Science, 2(3), 933-935.

Lumbantoruan, R. (2022). Penjadwalan kuliah dengan algoritma backtracking. Politeknik Informasi, 12. Makarim, F. (2024). Analisis penggunaan algoritma backtracking dalam penjadwalan kuliah. Jurnal Informatika

Institut Teknik Bandung, 5-6.

Munarto, R. (2019). Perancangan sistem penjadwalan kuliah di jurusan teknik elektro FT. UNTIRTA menggunakan teknik pewarnaan graph algoritma backtracking Welch-Powell. Seminar Nasional Inovasi Teknologi, 278.

Munir, R. (2020). Matematika diskrit. Informatika Bandung.

Putra, D. N. (2023). Penerapan dan implementasi algoritma backtracking. Departemen Teknik Informatika, Fakultas Teknologi Industri, Institut Teknologi Bandung (ITB), 10-12.

Rosmasari, D., Dengen, N., & Chandra, F. (2018). Implementasi algoritma constraint satisfaction problems pada

sistem penjadwalan mata kuliah. Jurnal Ilmu Pengetahuan dan Teknologi Komputer, 3(2), 169-176.

Russell, S., & Norvig, P. (2021). Artificial intelligence: A modern approach. Pearson Education. Rosen, K. (2020). Discrete mathematics and its applications (7th ed.). McGraw-Hill.

Sirait, R. B. (2020). Perancangan aplikasi game labirin dengan. Pelita Informatika Budi Darma, 100.

Siregar, N. (2024). Penerapan algoritma backtracking dalam penyelesaian masalah. JUSINFO (Jurnal Sains dan Informatika), 2.

Wulandari, D. Y. (2020). Representasi pohon dari graf kordal bipartisi (Tesis, Universitas Sumatera Utara). Medan.

Wulandari, R. (2022). Penjadwalan mata kuliah dengan modifikasi. Buletin Ilmiah Math. Stat. dan Terapannya (Bimaster), 209.

Downloads

Published

2025-06-15

How to Cite

Ananda, S., Gibran, M. K. ., Syakbani, F. ., Ulfa, M. ., & Hasibuan , M. S. . (2025). Analysis of the Use of Backtracking Algorithm in Course Scheduling. Journal of Artificial Intelligence and Engineering Applications (JAIEA), 4(3), 2368–2375. https://doi.org/10.59934/jaiea.v4i3.1161

Issue

Section

Articles