Scheduling pedagogical tasks for university timetables: A field study

Houar, Asmaa; Bensmain, Yassir; Betaouaf, Talib Hicham

doi:10.1109/logistiqua55056.2022.9938074

Cited by 1 publication

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Scheduling problems are common in various fields such as cloud computing [9], [10], manufacturing [11], [12], [13], [14], [15], computer science [16], and crew scheduling [17], [18]. The University Course Timetabling Problem (UCTTP) is a specific scheduling problem that involves assigning courses, faculty members, and students to designated time slots and rooms while satisfying both hard and soft constraints [19], [20], [21], [22].…”

Section: Related Workmentioning

confidence: 99%

Efficient Heuristics for Timetabling Scheduling in Blended Learning

Jarraya

2024

IJCDS

View full text Add to dashboard Cite

Blended learning, an innovative educational approach adopted by the Saudi Electronic University, combines traditional face-to-face teaching with online methods to improve educational outcomes. However, implementing it effectively faces challenges, especially in shifting physical classes to virtual formats for faculty and students spread across distant campuses, potentially compromising the core principles of blended learning and reducing its effectiveness. Ideally, each student would attend one face-to-face and one virtual session per course weekly. Yet, operational challenges emerge due to geographical disparities between faculty and student locations, necessitating the conversion of face-to-face sessions into virtual ones. To address these challenges, this study proposes two novel heuristic strategies for scheduling timetables in blended learning contexts. The first heuristic, called Minimum Load Accumulation Heuristic (MLAH), aims to evenly distribute teaching loads among faculty members and time slots while maximizing the number of groups assigned to faculty members from the same campus. The second heuristic, called Average Load Accumulation Heuristic (ALAH), calculates the average load of all faculty members and time slots and reduces the number of iterations searching for the minimum load, as performed by MLAH. These strategies aim to minimize the conversion of face-to-face sessions to virtual, ensure fair distribution of teaching responsibilities, and maintain a balanced allocation of face-to-face and virtual classes throughout the academic year. The paper demonstrates the effectiveness of these algorithms in producing high-quality solutions comparable to those generated by CPLEX, with significantly reduced computational complexity.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient Heuristics for Timetabling Scheduling in Blended Learning

Jarraya

2024

IJCDS

View full text Add to dashboard Cite

show abstract

Scheduling pedagogical tasks for university timetables: A field study

Cited by 1 publication

References 16 publications

Efficient Heuristics for Timetabling Scheduling in Blended Learning

Efficient Heuristics for Timetabling Scheduling in Blended Learning

Contact Info

Product

Resources

About