• Journal of Arbitration Studies
• /
• v.32 no.4
• /
• pp.103-141
• /
• 2022

Traditionally, schedule analysis in Korea has been used, mainly through the Critical Path Method, to evaluate the claim for extension of time and/or the amount of liquidated damages for delay. Critical path method, however, cannot identify the delay event and its impact occurred in non-critical path especially in multi facility projects. In multi facility projects that comprise several independent but related facilities or structures, each facility has its own facility critical path the duration of which will be impacted by facility specific critical delays. Thus, only through the non-critical delay analysis along with the critical delay analysis damages not attributable to contractors may be remedied in full. Because all the records and pictures can reveal what has actually happened in post contract review, only the retrospective analysis rather than the prospective analysis based on the assumptions can establish the cause and allocate the each parties' responsibilities appropriately.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.219-222
• /
• 2003

본 논문에서는 주어진 자동화 시스템에 대하여 Critical Path 기법을 적용한 최적화 연구를 수행하였다. 탄약 운반 자동화 시스템에 대하여 공정순서와 시간개념이 들어간 Timed Petri-Net을 이용한 이산사건 공정모델을 구축하였으며, 이를 기초로 초기조건 및 제약조건을 고려하여 제악탐색기법을 이용하여 Critical Path를 찾고 여유 공정을 산출항으로써 공정 시간 최적화를 수행하였다.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.52 no.2
• /
• pp.27-34
• /
• 2010

The PERT is one form of probabilistic network and can have many critical paths in the concept of each work has dispersed complete time. Here we propose two operators to estimate the probabilistic complete time about serial and parallel connections, and in each junction node, probability of critical path is estimated by new operator. Then we compare the estimated results with robability of critical path with deterministic CPM and Monte Carlo simulation (MCS). Our results show that all paths in PERT can be critical path, and proposed operators are efficient and accurate probabilistic calculators compare MCS result.

• Journal of Nutrition and Health
• /
• v.34 no.6
• /
• pp.701-714
• /
• 2001

The purpose of this study was to apply a PERT-type system, a combination of the project evaluation and review technique(PERT) and critical path method(CPM) on the employees' work time management of flood preparation, assembly, transportation and cleaning in home-delivered meals program for elderly The resources allotment heuristic program was developed by considering the number of employees and cooking utilities, being limited resources of home- delivered meals program. This program could assign the employees to perform the works included in flood preparation, assembly, transportation ind cleaning. Critical path and activities ware identified by PERT-type system on the basic of work time investigation in five senior centers. Work sheets were invented to perform the work by the shortest path with flexible employees'maximum flow As a result of the work time investigation, the most prevalent activities were ones of preparation in center C and E. Besides, the preparation(over fifty percent) was the most proportion among flood preparation, assembly, transportation and cleaning in center C and E. Critical path and activities of 'C'center were cucumber in sauce preparation path and assembly, wrapping in assembly path and case delivery in transportation path. Critical path and activities of 'E'center were Pan-fried Potato Preparation Path and assembly, case covering, wrapping in assembly Path. The work sheet invented by the heuristic program and PERT-type system reduced the work completion time and man hours in both centers.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.1-10
• /
• 1998

This paper is to propose an algorithm named as DYSAC to find the critical path(the longest sensitizable path) in a large digital circuit, whose purpose is to reduce the time to find critical path and to find critical paths of the circuits for which the previous methods could not find one. Also a set of path sensitization criteria named as DYPSEC is proposed, which is used to select a path from input to the output inside the DYSAC. The DYSAC consists of two sub-algorithms; the level assignment algorithm to assign a level to each node and the critical path selection algorithm to select the sensitizable path. The proposed algorithm was implemented with C-language on SUN Sparc and applied to the ISCAS'85 benchmark circuits to make sure if it works correctly and finds the correct critical path. Also, the results from the experiments were compared to the results from the previous works. The comparison items were the ability to find the critical path and the speed, in both of which the proposed algorithm in this paper shows better results than others.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.1
• /
• pp.37-42
• /
• 2009

The digital filter is essential element in digital signal processing area. It needs a high computational burden caused by multiplying and adding. The multiplier in digital filter is a dominant element, which occupies an wide area at the field of VLSI design, needs high power-consuming and also decides critical path that affects to filter performance. In this paper we proposed the simultaneous transform method which is represented 2's complementary representation to CSD and MSD representation to solve a complexity problem and to improve a computational speed. The performance of proposed method was implemented in VHDL and applied to an digital filters, was evaluated the decreasing of critical path delay.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.3
• /
• pp.90-96
• /
• 2011

Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret. Then the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.126-148
• /
• 2015

Different from the existing works on coverage problems in wireless sensor networks (WSNs), this paper considers the exposure-path prevention problem by using the percolation theory in three dimensional (3D) WSNs, which can be implemented in intruder detecting applications. In this paper, to avoid the loose bounds of critical density, a bond percolation-based scheme is proposed to put the exposure-path problem into a 3D uniform lattice. Within this scheme, the tighter bonds of critical density for omnidirectional and directional sensor networks under random sensor deployment-a 3D Poisson process are derived. Extensive simulation results show that our scheme generates tighter bounds of critical density with no exposure path in 3D WSNs.

• Journal of the Korea Institute of Building Construction
• /
• v.18 no.6
• /
• pp.595-602
• /
• 2018

Network-based scheduling methods can be classified into CPM method and PERT method. In the network scheduling chart, critical path can be estimated by performing the forward calculation and the backward calculation though the paths in the network chart. In PERT method, however, it is unreasonable to simply estimate the critical path by adding the sum of the activity durations in a specific path, since it does not incorporate probabilistic concept of PERT. The critical path of a PERT network can change according to the target period and deviation, and in some cases, the expected time of the critical path may not be the path with longest expected time. Based on this concept, this study proposes a technique to derive the most-likely critical path by comparing the sum of estimated time with the target time. It also proposes a method of systematically deriving all alternate paths for a network of repetitive activities. Case studies demonstrated that the most-likely critical path is not a fixed path and may vary according to the target period and standard deviation. It is expected that the proposed method of project duration forecasting will be useful in construction environment with varying target date situations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.131.4-131
• /
• 2001

A lot of path planning algorithms have been developed to find the collision-free path with minimum cost. But most of them require complicated computations. In this paper, a thinning method, which is one of the image processing schemes, was adopted to simplify the path planning procedure. In addition, critical points are used to find the shortest-distance path among all possible paths from the start to the goal point. Since the critical points contain the information on the neighboring paths, a new path can be quickly obtained on the map even when the start and goal points change. To investigate the validity of the proposed algorithm, various simulations have been performed for the environment where the obstacles with arbitrary shapes exist. It is shown that the optimal paths can be found with relative easiness.