Real-life Curriculum-based Timetabling

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00057906" target="_blank" >RIV/00216224:14330/12:00057906 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Real-life Curriculum-based Timetabling

Popis výsledku v původním jazyce

This paper presents an innovative approach to curriculum-based timetabling. Curricula are defined by a rich model that includes optional courses and course groups among which students are expected to take a subset of courses. Transformation of the curriculum model into the enrollment model is proposed and a local search algorithm generating corresponding enrollments is introduced. This enables curriculum-based timetabling in any existing enrollment-based course timetabling solver. The approach was implemented in a well established enrollment-based course timetabling system UniTime. The system has been successfully applied in practice at the Faculty of Education at Masaryk University for about 7,500 students and 260 curricula. Experimental results related with this problem are demonstrated for two semesters.

Název v anglickém jazyce

Real-life Curriculum-based Timetabling

Popis výsledku anglicky

This paper presents an innovative approach to curriculum-based timetabling. Curricula are defined by a rich model that includes optional courses and course groups among which students are expected to take a subset of courses. Transformation of the curriculum model into the enrollment model is proposed and a local search algorithm generating corresponding enrollments is introduced. This enables curriculum-based timetabling in any existing enrollment-based course timetabling solver. The approach was implemented in a well established enrollment-based course timetabling system UniTime. The system has been successfully applied in practice at the Faculty of Education at Masaryk University for about 7,500 students and 260 curricula. Experimental results related with this problem are demonstrated for two semesters.

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í

2012

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

Proccedings of the 9th International Conference on the Practice and Theory of Automated Timetabling

ISBN

9788214052985

ISSN

—

e-ISSN

—

Počet stran výsledku

16

Strana od-do

57-72

Název nakladatele

SINTEF

Místo vydání

Son, Norway

Místo konání akce

Son, Norway

Datum konání akce

1. 1. 2012

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

WRD - Celosvětová akce

Kód UT WoS článku

—