Institutional Repository of Vilnius University
Tvarkaraščio realizacija žiniatinklio terpėje taikant grafo viršūnių spalvojimo algoritmus /
Abstract
dc:descriptionAcademic scheduling it is a process of distributing a finite set over time which is limited by the certain recources. The problem of scheduling is relevant to various educational institutions and is often solved by graph coloring. The main task of the article is to compile a student weekly schedule for a typical University Faculty, basically by using the graph vertices coloring algorithms. Developing the scheduler various requirements of weekly scheduling was taken into account, such as the fact that the teacher or student is unable to attend in two same places at the same time, limited number of lectures per day, specialized audiences, suitable for theoretical or practical activities and teachers working hours preferences. The timetable was depicted in the web by using „greedy“ and „backtracking“ graph vertices coloring algorithms. Created scheduler program is user-oriented, easy to operate and properly schedules a timetable that can fuction in a real-life environment.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2020
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kankevičius, Andrius,
- Contributors dc:contributor
-
- Katin, Igor
Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- lit
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD81918031&prefLang=en_US