KOCHANIKOVÁ, Beáta and Hana RUDOVÁ. Student Scheduling for Bachelor State Examination. In Graham Kendall, Greet Vanden Berghe, Barry McCollum. Proceedings of the 6th Multidisciplinary International Scheduling Conference (MISTA 2013). Gent, Belgium: MISTA, 2013, p. 762-766. ISSN 2305-249X.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Student Scheduling for Bachelor State Examination
Authors KOCHANIKOVÁ, Beáta (703 Slovakia, belonging to the institution) and Hana RUDOVÁ (203 Czech Republic, guarantor, belonging to the institution).
Edition Gent, Belgium, Proceedings of the 6th Multidisciplinary International Scheduling Conference (MISTA 2013), p. 762-766, 5 pp. 2013.
Publisher MISTA
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Belgium
Confidentiality degree is not subject to a state or trade secret
Publication form storage medium (CD, DVD, flash disk)
RIV identification code RIV/00216224:14330/13:00067062
Organization unit Faculty of Informatics
ISSN 2305-249X
Keywords in English Examination Timetabling; Student Scheduling; Assignment Problem; Local Search; Real-life Problem
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 17/4/2014 10:32.
Abstract
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.
Links
GAP202/12/0306, research and development projectName: Dyschnet - Dynamické plánování a rozvrhování výpočetních a síťových zdrojů (Acronym: Dyschnet)
Investor: Czech Science Foundation
PrintDisplayed: 27/5/2024 20:51