|
|
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.
|
|
|
Asynchronous communication interfaces in FPGA
Cabal, Jakub ; Fujcik, Lukáš (referee) ; Bohrn, Marek (advisor)
The aim of this thesis is to analyze the options for implementation of asynchronous modules for clock domain crossing in an FPGA circuit. Such crossings are inevitable in moderately complex firmware designs and can lead to data corruption or loss, if implemented incorrectly. Furthermore, the work deals with application of correct constraints. The practical part of this work describes an implemented library of clock domain crossing modules. Further, the practical part describes a created methodology for use of clock domain crossing modules, whose application is demonstrated in a case study of a network interface card circuit created for the acceleration card COMBO-80G.
|
|
|
Toolbox for multi-objective optimization
Marek, Martin ; Hurák,, Zdeněk (referee) ; Kadlec, Petr (advisor)
This paper deals with multi-objective optimization problems (MOOP). It is explained, what solutions in multi-objetive search space are optimal and how are optimal (non-dominated) solutions found in the set of feasible solutions. Afterwards, principles of NSGA-II, MOPSO and GDE3 algorithms are described. In the following chapters, benchmark metrics and problems are introduced. In the last part of this paper, all the three algorithms are compared based on several benchmark metrics.
|
|
|
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.
|
|
|
Use the simplex algorithm to transform production
GUROVIČOVÁ, Eva
The aim of the thesis was to design the transformation of production using the simplex algorithm. My thesis is focus on the transformation of the original Bachelor thesis, for which I created the initial production of the holding, with a focus on plant and animal production. The transformation concentrates on the conversion of the milk's production to production focused on breeding cows without market milk production. The base stone was redoing the plant production. Plant production has been used not only for the production of custom feeding, but for the sale of plant commodities on the market to increase profits. The new production focuses on the cultivation of the crop production purely for their own consumption as feed for livestock. All profits create livestock production. The intention was therefore to transform the plant and livestock production, so as to obtain the most effective new way to use areas, for a change of the production.
|
guest ::
