University Examination Timetabling Problem is the most important combinational problem to develop a conflict-free timetable to execute all of the exams in and with the limited timeslots and other resources for universities, colleges or schools. It is also an important Nondeterministic Polynomial Time (NP)-hard problem that has no deterministic…

This systematic literature review investigates the fairness of machine learning algorithms in educational settings, focusing on recent studies and their proposed solutions to address biases. Applications analyzed include student dropout prediction, performance prediction, forum post classification, and recommender systems. We identify common…