|
|
Mobile Application for Scheduling Activities at Summer Camps
Holub, Ondřej ; Martiček, Štefan (referee) ; Češka, Milan (advisor)
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.
|
|
|
Production scheduling optimization
Kovářová, Karolína ; Šeda, Miloš (referee) ; Kůdela, Jakub (advisor)
This master’s thesis deals with production scheduling and its optimization. Scheduling plays an important role in a wide variety of areas – e.g., manufacturing, services, transport, and distribution. The theoretical part is dedicated to a brief historical overview and development of scheduling problems, then the classification of these problems and the basics of optimization. A scheduling task for the practical part is selected and methods applicable for its optimization are described. Selected algorithms are implemented, applied to five test instances, and then compared.
|
|
|
Mobile Application for Scheduling Activities at Summer Camps
Holub, Ondřej ; Martiček, Štefan (referee) ; Češka, Milan (advisor)
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.
|
|
|
Selected methods for solving integer programming problems
Picková, Veronika ; Sekničková, Jana (advisor) ; Charvát, Karel (referee)
This final thesis work is dealing with the problems of mixed integer linear programming and their possible methods of solving. The reader will be introduced to the issues of integer programming in the first part of the work. There follow the different methods of solving in the second part, concretely the possibility of solving without the integer constraints and rounding the solution, the branch and bound method and the Gomory's method. The purpose of this work is to inform the reader about the Benders decomposing algorithm. Decomposing methods divide the original problem into two parts: a part with the constraints of integrity and a part without them. All of the explained methods are supported by illustrative examples. The third part of this thesis is the application of used methods to a concrete problem.
|
|
|
Optimal composition of groceries for mountain trip
Fesenko, Anastasiya ; Kalčevová, Jana (advisor) ; Flusserová, Lenka (referee)
This work is aimed towards the application of knapsack problem in practical example of packing of groceries for mountain trip. The knapsack problem is one of the tasks of integral programming; those are the models that can only variably accept the integral value. The solutions of integral tasks are usually very meticulous. That is why for their solution special algorithms were created, which are capable of discovering an integral solution of such tasks, for example, branch and bound method, Balas method etc. These types of algorithms are defined in the first part of this work. While writing this thesis a considerable emphasis was put into application of its result in practice. Hence, for achieving applicability practical tasks are solved from various angles and therefore various aims have been set forth in each solution option. The results of each option are interpreted and then the differences are explained.
|
guest ::
