工程論理ネットワークの自動生成による修復期間の評価

DOI Web Site Web Site 被引用文献2件 オープンアクセス

書誌事項

タイトル別名
  • EVALUATION OF REPAIR TIME BY AUTOMATIC GENERATION OF LOGIC NETWORK OF REPAIR SCHEDULE
  • 工程論理ネットワークの自動生成による修復期間の評価 : 論理ネットワークの自動生成と工種を考慮した作業員数配置の最適化
  • コウテイ ロンリ ネットワーク ノ ジドウ セイセイ ニ ヨル シュウフク キカン ノ ヒョウカ : ロンリ ネットワーク ノ ジドウ セイセイ ト コウシュ オ コウリョ シタ サギョウインスウ ハイチ ノ サイテキカ
  • － Automatic generation of logic network and optimization of number of workers considering types of works －
  • －論理ネットワークの自動生成と工種を考慮した作業員数配置の最適化－

この論文をさがす

抄録

<p> This paper dealt with methods of repair time assessment of a building damaged by an earthquake. The repair time is as important as the repair cost as the economic loss by damage of building in an earthquake, because the repair time is directly related to the economic loss of the owner in the profit building, and indirectly to the occupants and the surrounding society due to the loss of its function.</p><p> Repair costs for buildings are, in principle, given as the sum of repair costs for members of building, but it is even more difficult to evaluate the repair period because it is necessary to consider the repair schedule. In this paper, the repair schedule is expressed as a logical network, and a method for automatically generating a logical network for the building repair schedule is proposed, given the member repair schedule.</p><p> Given a list of preceding activities that need to be performed immediately before each activity, the node number of the logical network can be automatically determined, that means that a logical network has been created. In construction process, specific kind of tasks may be required to carry out simultaneously on the floor. Synchronization of activities is realized by manipulating the preceding activity list according to certain rules.</p><p> A method for evaluation of the shortest repair time under the worker resource constraints considering worker types is also proposed. It is possible to find the shortest construction period by appropriately shifting the workers from the activity which has the longest total float among the simultaneously executing activities whose worker type is same as that of the critical activity, to the critical activity. However, the convergence calculation for the shortest repair time, are not stable in many cases because the critical path changes in the process. In order to avoid this problem, a method consist of two steps is proposed. The first step is a searching stage where candidates of critical path those give a shortest repair time. The second step is convergence stage where each candidate is optimized. The second step is carried out progressively not to change critical path. Among the converged candidates, the candidate which has shortest repair time is adopted as the optimum value.</p><p> The method proposed in this paper can automatically generate a repair schedule for arbitrary damaged state and uniquely determine the repair time. Because the calculation process is automated, it can be incorporated into the Monte Carlo simulation proposed in FEMA P-58.</p>

収録刊行物

被引用文献 (2)*注記

もっと見る

関連プロジェクト

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ