Thesis Details
Algoritmy rozvrhování výroby s dynamickými rekonfiguracemi a údržbou
Thesis deals with the topic of computational scheduling of production with dynamic reconfigurations and maintenance. The problem is formally defined by a mathematical model named Resource Constrained Project Scheduling Problem which was extended by dynamic reconfiguration and maintenance. Number of different schedule generation algorithms were proposed based on this model. Also methods of solution optimization based on genetic algorithms were described. The typology of production orders of which different task types are created was described in the experimental part. The result of the experiments is clear recommendation of scheduling algorithm for given task type. For the conclusion, thesis deals with the case study of choice of suitable solution for specific production companies.
scheduling, planning, RCPSP, production control, genetic algorithms, dynamic reconfiguration, maintenance
Burget Radek, doc. Ing., Ph.D. (DIFS FIT BUT), člen
Hruška Tomáš, prof. Ing., CSc. (DIFS FIT BUT), člen
Janoušek Vladimír, doc. Ing., Ph.D. (DITS FIT BUT), člen
Matoušek Petr, doc. Ing., Ph.D., M.A. (DIFS FIT BUT), člen
Polášek Ivan, doc. Ing., Ph.D. (FIIT STU), člen
@mastersthesis{FITMT19966,
author = "Mari\'{a}n Hal\v{c}in",
type = "Master's thesis",
title = "Algoritmy rozvrhov\'{a}n\'{i} v\'{y}roby s dynamick\'{y}mi rekonfiguracemi a \'{u}dr\v{z}bou",
school = "Brno University of Technology, Faculty of Information Technology",
year = 2017,
location = "Brno, CZ",
language = "czech",
url = "https://www.fit.vut.cz/study/thesis/19966/"
}