engleski

Minimisation of Collisions in Scheduling of Lectures

It is a hard problem to produce a schedule of lectures a posteriori, after the students have enrolled in individualised curricula characterised by strong electivity of courses. There are initial restrictions on availability of resources: lecturers, students and the premises. A useful software tool to solve this problem has been developed as result of a graduation thesis. The lecturers are regarded as the most important resource. Their forbidden times must be respected and they must not collide within the constructed timetable. The usage of premises also must not collide but if their availability is high enough, they can be easily resolved manually. The last, but also important factor is to avoid collision from the standpoint of students. Genetic algorithm has been applied and the performances were very satisfactory.

Scheduling; Genetic algorithm; Elective courses; Software tool

nije evidentirano