Student Scheduling for Bachelor State Examination

Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

KOCHANIKOVÁ Beáta RUDOVÁ Hana

Year of publication 2013
Type Article in Proceedings
Conference Proceedings of the 6th Multidisciplinary International Scheduling Conference (MISTA 2013)
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords Examination Timetabling; Student Scheduling; Assignment Problem; Local Search; Real-life Problem
Description A rich set of papers was devoted to the examination timetabling problems. This work introduces a different examination timetabling problem which belongs to the class of assignment problems. Here just one student must be scheduled at each time period to be examined by a commission and to show results of his/her Bachelor thesis in the presence of the supervisor and the referee. The characteristics of the problem with pre-assigned examiners in each commission are discussed and optimization criteria are proposed. The solver for construction and improvements of such student schedules by local search methods is described. Preliminary experimental evaluation is presented for two real-life data instances. Our generated timetables are compared with the manually constructed timetables which has been created by one of the authors and used in practice.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.