Thesis Details
Mobilní aplikace pro rozvrhovaní disciplín na dětském táboře
The main goal of this thesis is to design and implement a mobile application assisting in scheduling activities at summer camps taking into account the preferences of camp participants. This is done in a way that ensures the minimization of conflicts with respect to user-defined constraints. QR code scanning is used as an effective method of data input. The main process of finding an optimal solution is formalized as a graph colouring problem and is implemented using the branch and bound method. The created system does not require any other device for its functioning, all the necessary calculations are being executed on a mobile phone of the user. This system has significantly accelerated and simplified the process of scheduling activities at summer camps.
mobile application, constraint scheduling, conflict minimization, graph colouring problem, branch and bound method, effective input of data, Flutter, QR, Branch and Bound method, operational analysis
Burget Radek, doc. Ing., Ph.D. (DIFS FIT BUT), člen
Čadík Martin, doc. Ing., Ph.D. (DCGM FIT BUT), člen
Češka Milan, doc. RNDr., Ph.D. (DITS FIT BUT), člen
Martínek Tomáš, doc. Ing., Ph.D. (DCSY FIT BUT), člen
@bachelorsthesis{FITBT23179, author = "Ond\v{r}ej Holub", type = "Bachelor's thesis", title = "Mobiln\'{i} aplikace pro rozvrhovan\'{i} discipl\'{i}n na d\v{e}tsk\'{e}m t\'{a}bo\v{r}e", school = "Brno University of Technology, Faculty of Information Technology", year = 2020, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/23179/" }