Student Scheduling for Bachelor State Examination

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00067062" target="_blank" >RIV/00216224:14330/13:00067062 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Student Scheduling for Bachelor State Examination

Popis výsledku v původním jazyce

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 manuallyconstructed timetables which has been created by one of the authors and used in practice.

Název v anglickém jazyce

Student Scheduling for Bachelor State Examination

Popis výsledku anglicky

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 manuallyconstructed timetables which has been created by one of the authors and used in practice.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F12%2F0306" target="_blank" >GAP202/12/0306: Dyschnet - Dynamické plánování a rozvrhování výpočetních a síťových zdrojů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 6th Multidisciplinary International Scheduling Conference (MISTA 2013)

ISBN

—

ISSN

2305-249X

e-ISSN

—

Počet stran výsledku

5

Strana od-do

762-766

Název nakladatele

MISTA

Místo vydání

Gent, Belgium

Místo konání akce

Gent, Belgium

Datum konání akce

1. 1. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—