Thesis Details

Heuristiky v optimalizačních úlohách třídy RCPSP

Master's Thesis Student: Šebek Petr Academic Year: 2014/2015 Supervisor: Hrubý Martin, Ing., Ph.D.
English title
Meta-Heuristic Solution in RCPSP
Language
Czech
Abstract

This thesis deals with the description of the state of resource-constrained project scheduling problem. It defines the formal problem and its complexity. It also describes variants of this problem. Algorithms for solving RCPSP are presented. Heuristic genetic algorithm GARTH is analyzed in depth. The implementation of prototypes solving RCPSP using GARTH is outlined. Several improvements to the original algorithm are designed and evaluated.

Keywords

Scheduling, Resource-constrained project scheduling problem, RCPSP, heuristic algorithm, genetic algorithm, GARTH

Department
Degree Programme
Information Technology, Field of Study Mathematical Methods in Information Technology
Files
Status
defended, grade A
Date
24 June 2015
Reviewer
Committee
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT), předseda
Burget Radek, doc. Ing., Ph.D. (DIFS FIT BUT), člen
Drahanský Martin, prof. Ing., Dipl.-Ing., Ph.D. (DITS FIT BUT), člen
Hrubý Martin, Ing., Ph.D. (DITS FIT BUT), člen
Rozinajová Viera, doc. Ing., Ph.D. (FIIT STU), člen
Ryšavý Ondřej, doc. Ing., Ph.D. (DIFS FIT BUT), člen
Citation
ŠEBEK, Petr. Heuristiky v optimalizačních úlohách třídy RCPSP. Brno, 2015. Master's Thesis. Brno University of Technology, Faculty of Information Technology. 2015-06-24. Supervised by Hrubý Martin. Available from: https://www.fit.vut.cz/study/thesis/13440/
BibTeX
@mastersthesis{FITMT13440,
    author = "Petr \v{S}ebek",
    type = "Master's thesis",
    title = "Heuristiky v optimaliza\v{c}n\'{i}ch \'{u}loh\'{a}ch t\v{r}\'{i}dy RCPSP",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2015,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/13440/"
}
Back to top