| Summary: | 碩士 === 國立臺灣科技大學 === 營建工程系 === 106 === In recent years many railway projects such as Taoyuan Airport MRT, Kaohsiung
MRT and Taiwan High Speed Rail have been completed. In addition, the budget of
future railway projects account for 48.1% in the forward-looking infrastructure plan,
which highlights its importance. Railways, highways, airport runways, tunnels, bridges
are all repetitive projects repeatedly done by crews along the planned linear direction.
However, the traditional planning methods such as CPM, PERT, do not show the
characteristics of the repetitive work in the repetitive project, as they cannot identify
the progress of activities and the locations of crews. Therefore, the construction logic
sequence cannot reflect the distance requirement between crews, and the planner cannot
make appropriate allocation of resources for the work place.
This study applies graphical scheduling to repetitive projects. In order to schedule
the sequence of the activities, this study designed a graphical algorithm. The meaning
of “graphical” is to calculate the relationship between activities in a geometric way.
Compared with the traditional algebra algorithm the relationship between activities can
be defined more clearly. The computer program is developed in the .NET Framework
to implement the algorithm. The purpose of this research to develop a graphical user
interface to facilitate the input process of activity information, as well as the
relationship defining between activities in a simple and direct way. The scheduling
results use a two-dimensioml chart to express the activity units and working process of
the repetitive project, and to mark the relationship between activities on the chart.
Taking into account the construction rate of different crews and the required distance
between the crews, the proposed algorithm assists the scheduler in planning the start
time for each activity, estimating the project duration, and presenting a repetitive project schedule. This thesis defines three types of activity(Line,Box,Bar) and their
relationship(Global Time,Global Distance,Local Distance,Continuity), then explains
the algorithmic steps, and finally, the scheduling results and scenario analysis are
presented through case studies of multiple repetitive projects.
|
|---|
