|
|
Ordering of Jobs for Pickling Lines
Plšek, Michal ; Tinka, Jan (referee) ; Kanich, Ondřej (advisor)
This work resolves the scheduling problem of multiple hoists transporting products between chemicals baths of pickling line. Harmonograms of products are calculated by modified Shifting bottleneck heuristic, which prevents product conflicts inside baths. Genetic algorithm NSGA-II is used for solution-space search. Web application built over the optimization process allows user to manage/edit products, hoists, baths, configuration parameters and optimization results. Applying proposed heuristic to smaller optimization tasks boosts production effectivity up to 30-45 % (comparing to naive harmonograms). The result of this work is application on the basis of which full-fledged C++ application might be programmed. Then it might be used for solving larger-scale problems.
|
|
|
Job Scheduling in Logistic Warehouses
Povoda, Lukáš ; Uher, Václav (referee) ; Karásek, Jan (advisor)
The main aim of this thesis is flow shop and job shop scheduling problem in logistics warehouses. Managing and scheduling works is currently often problem. There is no simple solution due to complexity of this problem. This problem must be resolved because of a lack efficiency of work with a higher load such as during the christmas holidays. This paper describes the methods used to solve this problem focusing mainly on the use of search algorithms, evolutionary algorithms, specifically grammar guided genetic programming. This paper describes the problem of job shop scheduling on a simple theoretical example. The implemented algorithm for solving this problem was subjected to tests inspired on data from real warehouse, as well as synthetically created tests with more jobs and a greater number of workers. Synthetic tests were generated randomly. All tests were therefore run several times and the results were averaged. In conclusion of this work are presented the results of the algorithm and the optimum parameter settings for different sizes of problems and requirements for the solution. Genetic algorithm has been extended to calculate fitness of individuals with regard to number of collisions, extended to use priority rules during run of evolution, and some parts of algorithm was parallelized.
|
|
|
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.
|
|
|
Ordering of Jobs for Pickling Lines
Plšek, Michal ; Tinka, Jan (referee) ; Kanich, Ondřej (advisor)
This work resolves the scheduling problem of multiple hoists transporting products between chemicals baths of pickling line. Harmonograms of products are calculated by modified Shifting bottleneck heuristic, which prevents product conflicts inside baths. Genetic algorithm NSGA-II is used for solution-space search. Web application built over the optimization process allows user to manage/edit products, hoists, baths, configuration parameters and optimization results. Applying proposed heuristic to smaller optimization tasks boosts production effectivity up to 30-45 % (comparing to naive harmonograms). The result of this work is application on the basis of which full-fledged C++ application might be programmed. Then it might be used for solving larger-scale problems.
|
|
|
Planning and Scheduling
Hefka, Lukáš ; Kočí, Radek (referee) ; Janoušek, Vladimír (advisor)
This thesis deals with optimization problems of planning and scheduling. There are using genetic algorithms which are inspired by evolution process. Main work is familiar with the problem of planning and scheduling, genetic algorithm and Petri nets. This knowledge was used to create applications that would with the use of genetic algorithms was able to solve planning problems and the resulting plans would be represented the Time Petri Net. In conclusion of the this thesis are presented obtained results and examples of field use.
|
|
|
Job Scheduling in Logistic Warehouses
Povoda, Lukáš ; Uher, Václav (referee) ; Karásek, Jan (advisor)
The main aim of this thesis is flow shop and job shop scheduling problem in logistics warehouses. Managing and scheduling works is currently often problem. There is no simple solution due to complexity of this problem. This problem must be resolved because of a lack efficiency of work with a higher load such as during the christmas holidays. This paper describes the methods used to solve this problem focusing mainly on the use of search algorithms, evolutionary algorithms, specifically grammar guided genetic programming. This paper describes the problem of job shop scheduling on a simple theoretical example. The implemented algorithm for solving this problem was subjected to tests inspired on data from real warehouse, as well as synthetically created tests with more jobs and a greater number of workers. Synthetic tests were generated randomly. All tests were therefore run several times and the results were averaged. In conclusion of this work are presented the results of the algorithm and the optimum parameter settings for different sizes of problems and requirements for the solution. Genetic algorithm has been extended to calculate fitness of individuals with regard to number of collisions, extended to use priority rules during run of evolution, and some parts of algorithm was parallelized.
|
|
|
Scheduling in systems with multiple machines
Černý, Jan ; Pelikán, Jan (advisor) ; Zouhar, Jan (referee)
This paper focuses on characterization of scheduling in systems with one or multiple machines. There are different types of tasks given, with which we can encounter in scheduling. At the beginning, introduce basic concepts of production scheduling. The second chapter is a flowshop problem with its history and projections for the flowshop problem. In the next chapter is a modification of flowshop problem called hybrid flowshop, which is divided according flexibility to hybrid flowshop with processing flexibility and hybrid flowshop with routing flexibility. Another chapter is open shop problem, which have some differences compare with the above mentioned types. The last chapter is a job shop, stating in a graphical solution for two machines and a brief description of the algorithm Shifting bottleneck.
|
guest ::
