Algoritmy pro řešení rozvrhovacích problémů s omezenými zdroji

Abstract

The aim of the diploma thesis is the implementation of several algorithms for solving problems known as RCPSP - resource constraint project scheduling problem. This problem can be described as a set of resources with limited capacity to be associated with a set of activities or tasks. Activities have a defined time duration and must be performed in given order. The algorithms create schedules for project activities. We will focus on schedules for which all dependencies between activities are respected and no capacity of any resource is exceeded. We will describe the algorithms that solve this problem and the data structures we will use. We focus on two types of algorithms - branch and bound algorithm and its truncated varsions and algorithms working with priority rules. Finally, we will perform a series of tests to evaluate the effectiveness of implemented algorithms.