| Abstract [eng] |
The goal of this master's degree thesis is to analyze problems of net planning. The thesis defines one way of determining the critical path. There are also algorithms of net graph parameters calculation analyzed and constructed. In addition, the thesis contains a computer program which determines critical path of net graph. Two problems are solved using this program. Implementation of net planning methods can help use time and other resources more effectively, organize and accomplish complex projects. Methods of net planning can gain interest not only of mathematicians, but also of managers, engineers, and those responsible for planning and managing complex systems. |
