The analysis of the dependence network consists in the calculation of dates and time reserves of subsequent events, and then on the calculation of the time stocks during the execution of particular activities. In the dependency network, it is possible to calculate the earliest and the latest possible date of occurrence of each event and the possible reserve of time. Thanks to this, we will learn the stock of time related to individual activities. Those activities that do not have a stock of time (that is, the reserve is equal to zero) are called critical activities. All critical activities in the dependence network create a critical path. We will not have any stock of time on the entire critical path (from the event of the initial linking network to the final event). What's the conclusion? Activities that are on the critical path must be made at the scheduled time, because it will decide on keeping the deadline for the entire undertaking.
Wołowiec et al. (Fri,) studied this question.