Acta Scientiarum Polonorum

Abstract: The aim of study was to estimate and discuss the maximum number of the realization dates of task and of all tasks contained in a network schedule time – limit. In this paper was considered task realization without any breaks as well as with division into two stages. Worked out formula was used to analyse very simple network schedule created from six tasks. In the second part of article it was proved that the number of possible task structures in the whole schedule depends mostly on the deadline realization time of enterprise, whole time slack in each task and on the number of all tasks in chart schedule. Obtained results have basic meaning while looking for an algorithm of resource analysis which enables to connect for all task start and end dates with available sources. Properly constructions and analysis of network schedule is necessary to create an effective project plan while keeping various technologic and organization conditions.