Study On The Application Of BANT Basic Network And Its Algorithm

Since its appearance, network planning techniques have been playing an increasingly important role in people's lives. Traditional network planning techniques and their computational methods of time parameters, such as Critical Path Method (CPM), have been widely divinized by scholars and engineers. After pointing out that there are some disputable issues in the traditional network planning techniques and their computational methods themselves, bringing into semeiology, and retaining kernel computational formula from the traditional ones, some Chinese scholar contrived BANT network and its algorithm, which have already been developed into a relatively integral theoretical system.Starting from the basic network, on which the durations of and the logic relations between the activities are fixed, this thesis summarizes the characteristics of the traditional network planning techniques and their computational methods of time parameters, provides an arithmetical example which can adequately verify the self-unconsistency in the traditional ones, and thus further strengthen the theoretical basis of the BANT network. After that, this thesis points out some problem that needs further discussion and raises some proposal of the author in the process of introducing BANT network and its computational procedure. Then, by means of time-coordinate network planning and an arithmetical example, the thesis compares the results from the two methods-CPM and BANT computational methods, points out the phenomenon that BANT latest must-time is never later than CPM latest must-time, which is proved subsequently. In the meantime, the necessity of introducing BANT latest time is deliberated. All these enrich the theory of BANT network. Lastly, the applicability of the BANT basic network is deliberated based on the simulation of two common construction scenarios.