National Repository of Grey Literature 6 records found  Search took 0.00 seconds. 
Production of the "Cooling Roller"
Kafka, Ondřej ; Prokeš, Tomáš (referee) ; Kalivoda, Milan (advisor)
The aim of this bachelor thesis is propose a complete production process of the cooling roller manufacturing assembly, starting with the proposal of semi-finished products for production, individual production steps to the completion of the whole assembly and his final inspection. The work will focus mainly on machining operations, which will be described and specified in detail.
Vehicle Routing Problem
Kafka, Ondřej ; Branda, Martin (advisor) ; Hanzák, Tomáš (referee)
The thesis deals with optimization problems which arise at distribution planning. These problems can often be easily formulated as integer programming problems, but rarely can be solved using mixed integer programming techniques. Therefore, it is necessary to study the efficiency of heuristic algorithms. The main focus of the thesis is on the vehicle routing problem with time windows. A tabu search algorithm for this problem was developed and implemented. It uses integer programming to solve the set partitioning problem in order to find optimal distribution of all customers into feasible routes found during the search. The results of the classical integer programming approach, basic insertion heuristic and presented tabu search algorithm are compared in a numerical study.
Lot-sizing problem
Kafka, Ondřej ; Branda, Martin (advisor) ; Bejda, Přemysl (referee)
Title: Lot-sizing problem Author: Ondřej Kafka Department: Department of probability and mathematical statistics Supervisor: RNDr. Martin Branda, Ph.D. Abstract: In the present work, we define the basic concepts of lot-sizing. We introduce Wagner-Whitin's dynamic lot size problem and derive a dynamic programming algorithm for the solution. Next we look at the case of PCLSP (Profit maximizing capacitated lot size problem) problem with fixed prices and negligable setup costs and solve it using specialized linear programming algorithm. Everything we try to explain with concrete examples. In the end we verify the efficiency of those algorithms by numerical study on random data comparing the performance of programmed algorithms with the professional optimization solver Gurobi. Keywords: Lot-sizing, dynamic programming, linear programming
Selected issues of the creditor's position in execution proceedings
Kafka, Ondřej ; Macková, Alena (advisor) ; Pohl, Tomáš (referee)
Kafka Ondřej Diplomová práce 68 ABSTRACT "Selected issues of position of the beneficiary in execution procedure" This thesis is engaged in execution proceedings, especially in procedural position of the entitled subject - beneficiary, it means in procedural relations, the party of which the beneficiary is. In kind of execution is in this thesis analysed just execution on money judgement. Whole matter is observed from the position of beneficiary, as it is foreshown in Chapter One. The main accent is put on the chosen tasks inseperably connected with the position of beneficiary, that are in common standing of executions solved very often. The reason of such kind of specialization is that within positive legal regulation in Czech Republic cannot be solicitation of debts through the execution proceedings considered as troublefree. Chapter Two briefly describes execution proceeding. More detailed despcription is devoted just to relevant differences between the execution realized by executor and per curiam. To the contrary the Chapter Three is focused directly on procedural position of beneficiary pending execution proceedings, e.i. within single stages. Statutory conditions for ordering to execution are than analyzed in closer method. Fourth Chapter deals with selected defects of execution title. Main...

Interested in being notified about new results for this query?
Subscribe to the RSS feed.