Study on Process of Construction Planning and its Application

Abstract

In this paper the planning process based on the network techniques is dealt with for a construction project where the project is defined as a function of sequence among jobs included in the project. The planning process consists of three processes : In the first process the set of alternatives of job sequences which satisfy the restriction for the completion time is obtained by the use of devised branch and bound algorithm. In the second process every kind of performance which is useful for the evaluation of construction project is computed for each alternative and further actual restrictions are established for all performances. In the last process alternatives which satisfy all restrictions are obtained by the filtering procedure and an optimal project is selected from them by a definite criterion. An application of this planning process is shown for the elevated railway construction of the New Sanyo Trunk Line.