Minimization of the Project Duration as a Linear Programming Problem

There is a network project with activities on arrows and a set of employees. Every employee executes each activity in a different length of time. The aim of this thesis is to find the activities assignment to the employees where the project duration is minimal. For this purpose, graph theory and linear programming methods are used. The introductory chapters describe the basic concepts of the disciplines of operations research that are relevant to this thesis. The content of the fifth, pivotal chapter is the creation of models through which the optimal assignment is sought. For each model, which is followed by computational experiments, optimization is done in two steps. The chapter is concluded by comparing the solutions which have been found