|
|
Personal Timetabling
Doležal, Lukáš ; Barták, Roman (advisor) ; Duša, Vladimír (referee)
Despite all the advancements in Artificial Intelligence, we still do not have a broadly available application for automated scheduling of personal activities. The main difficulty in creating such an application is satisfying user's diverse expectations about time organization. In this study we focused on creating a tool that can help users with organizing their time. We designed a model for describing personal activities with user preferences. We formulated scheduling of personal activities as an optimization problem for which we designed and implemented a solving algorithm, aiming to schedule activities with precision of seconds. We created a prototype of web-calendar application powered by this model and an algorithm which we designed with the focus on ability to clearly display user's time and easily insert activities for automated scheduling. The web application is backed by RESTful API which enables implementing application on various platforms. Powered by TCPDF (www.tcpdf.org)
|
|
|
Optimization of Production Processes
Halas, David ; Dvořák, Jiří (referee) ; Popela, Pavel (advisor)
This thesis deals with modelling diffenrent types of production lines. Modeling is done by the mathematical programming and simulation methods. Optimization related computations are mostly implemented in program GAMS. Simulation is realized by using program Matlab/SimEvents. The results are presented by the Gantt diagrams.
|
|
|
Airport - Time and resource constrained project sheduling
Vandas, Marek ; Petříčková, Zuzana (advisor) ; Pangrác, Ondřej (referee)
This thesis identifies constraints for safe ground airport operations. These operations consist of runway assignment, taxi operations planning and gate scheduling. The aim of this thesis is to show how this problem can be formulated as constraint satisfaction problem and then solved as a scheduling problem. Based on this model, an application that ilustrates these concepts is designed and implemented. This application enables a visualisation of results. An extendable constraint solver was implemented for the purpose of this application. This solver can be used to solve problems from other domains as well and also enables easy change of search strategy.
|
|
|
Workgroup Planning Application
Nguyen Cong, Thang ; Kopecký, Michal (advisor) ; Žemlička, Michal (referee)
This thesis describes design and implementation of a tool that supports workgroup planning. The system allows its users to manipulate their tasks, as well as supports collaboration of more users. The user interface of the application is based on lightweight web client. The application is modular, so that the enhancing of the application in the future will be as simple as possible.
|
|
|
Combinatorial algorithms for online problems: Semi-online scheduling on related machines
Ebenlendr, Tomáš ; Sgall, Jiří (advisor) ; Barták, Roman (referee) ; Epstein, Leah (referee) ; Woeginger, Gerhard (referee)
Mgr. Tomáš Ebenlendr Combinatorial algorithms for online problems: Semi-online scheduling on related machines Abstract of doctoral thesis We construct a framework that gives optimal algorithms for a whole class of scheduling problems. This class covers the most studied semi-online variants of preemptive online scheduling on uniformly related machines with the objective to minimize makespan. The algorithms from our framework are deterministic, yet they are optimal even among all randomized algorithms. In addition, they are optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. We provide new lower bound of 2.112 for the original online problem. The (deterministic) upper bound is e ≈ 2.718 as there was known e-competitive randomized algorithm before. Our framework applies to all semi-online variants which are based on some knowledge about the input sequence. I.e., they are restrictions of the set of valid inputs. We use our framework to study restrictions that were studied before, and we derive some new bounds. Namely we study known sum of processing times, known maximal processing time, sorted (decreasing) jobs, tightly grouped processing times, approximately known optimal makespan and few combinations. Based on the analysis...
|
|
|
O problémech seřazení při řízení servisních operací
Lín, Václav ; Vomlel, Jiří (advisor) ; Jiroušek, Radim (referee) ; Kouba, Zdeněk (referee) ; Ottosen, Thorsten Jorgen (referee)
The subject of the thesis belongs to the field of operations management. We deal with sequencing problems arising when there are multiple repair operations available to fix a broken man-made system and the true cause of the system failure is uncertain. It is assumed that the system is formally described by a probabilistic model, and it is to be repaired by a sequence of troubleshooting operations designed to identify the cause of the malfunction and fix the system. The challenge is to find a course of repair which has minimal expected cost. We study several variants of the problem proposed in the literature. We analyze computational complexity of those variants, apply integer linear programming to one variant of the problem, and examine the relation to machine scheduling.
|
|
|
Computer Optimization and Visualization of Production Schedules
Halčin, Marián ; Kočí, Radek (referee) ; Hrubý, Martin (advisor)
Thesis deals with a problem of scheduling manufacturing operations considering limited resources. Problem is formally defined by mathematical model named Resource Constrained Project Scheduling Problem. According to this model, a system has been developed for creating schedules and optimizer based on principles of Genetic Algorithms. Further there has been created program providing user interface that uses Gantt chart to visualize schedule and allows manual editing of the schedule. Solution was applied in environment of real manufacturing. Using data obtained from factory, experiments have performed to test implementation of genetic algorithm.
|
|
|
Comparison of Programs for Scheduling
Kubalcová, Monika ; Martinek, David (referee) ; Křena, Bohuslav (advisor)
This thesis deals with timetabling issues at the Faculty of Information Technology, Brno University of Technology. It focuses mainly on scheduling of lectures and exams for students. In first part, the current situation, restrictive conditions and actual procedure are described. Afterwards, theoretical aspects of scheduling problem are discussed. In the second part of the thesis, selected software application for automatic generation of timetables are compared. The most suitable application is then evaluated by producing a real timetable. The achieved results are discussed and the future directions are suggested in the conclusion.
|
|
|
Application for Generating of School Schedules
Fiala, Jan ; Horáček, Jan (referee) ; Rozman, Jaroslav (advisor)
This work deals with problem of generating school schedules. The solution is based on three heuristic algorithms (hill-climbing, simulated annealing, genetic algorithm) and is fully implemented in JAVA. It provides a comparison of implemented heuristic algorithms including description of their pros and cons.
|
|
| |
guest ::
