Assalamu’alaikum warahmatullahi wabarakatuh.
Welcome math explorers!
“Have you ever experienced class schedule conflicts, full classrooms, or unavailable lecturers?”
“These are classic problems in higher education.”
“But… can we create an efficient and conflict-free schedule? The answer is: YES!”
“Let’s explore how to build an effective course schedule using graph theory and the Welch-Powell
algorithm.”
let me intruduce myself, my name is A. Nur Hidayat Mustafa a undergraduate mathematics student
at university of Makassar
okey our topic today is The Scheduling Problem
“Creating a university schedule is no easy task.”
“Conflicting times, limited rooms, and lecturer availability make the process complex.”
“Manual methods like Excel are often error-prone.”
“The solution? A mathematical approach: graph coloring!”
“Using the Welch-Powell algorithm, we can build a schedule that:”
• Avoids overlapping courses
• Optimizes room usage
• Matches lecturer availability
Assalamu’alaikum warahmatullahi wabarakatuh.
Welcome math explorers!
“Have you ever experienced class schedule conflicts, full classrooms, or unavailable lecturers?”
“These are classic problems in higher education.”
“But… can we create an efficient and conflict-free schedule? The answer is: YES!”
“Let’s explore how to build an effective course schedule using graph theory and the Welch-Powell algorithm.”
