Sharh maqola

A Review of Optimization Algorithms for University Timetable Scheduling

Hamed S. AlghamdiCollege of Computer and Information Systems, Umm Al Qura University, Saudi ArabiaTahani AlsubaitCollege of Computer and Information Systems, Umm Al Qura University, Saudi ArabiaHosam AlhakamiCollege of Computer and Information Systems, Umm Al Qura University, Saudi ArabiaAbdullah BazCollege of Computer and Information Systems, Umm Al Qura University, Saudi Arabia

2020en

ABI

Annotatsiya

The university course timetabling problem looks for the best schedule, to satisfy given criteria as a set of given resources, which may contain lecturers, groups of students, classrooms, or laboratories. Developing a timetable is a fundamental requirement for the healthy functioning of all educational and administrative parts of an academic institution. However, factors such as the availability of hours, the number of subjects, and the allocation of teachers make the timetable problem very complex. This study intends to review several optimization algorithms that could be applied as possible solutions for the university student course timetable problem. The reviewed algorithms take into account the demands of institutional constraints for course timetable management.

Hali tarjima qilinmagan

Identifikatorlar

DOI: 10.48084/etasr.3832

Iqtiboslar va manbalar

2 ta iqtibos0 ta foydalanilgan manba

Koʻrsatkichlar — AkademScholar