USING GENETIC ALGORITHMS TO UNIVERSITY TIMETABLING PROBLEM

Abstract

The problem of timetabling in universities is an NP-hard problem, which involves a task scheduling activity for certain people based on multiple constraints and a limited number of resources. This paper addresses a complicated issue, that of scheduling academic classes (timetabling). The aim is to find a feasible schedule for the Faculty of Economics, Administration and Business at the University "Stefan cel Mare" in Suceava. The approach focuses on the use of genetic algorithms and has, as its main objective, the minimization of idle time for students who participate in teaching activities.