• Title/Summary/Keyword: Critical Path Method

Search Result 224, Processing Time 0.023 seconds

A Critical Path Search and The Project Activities Scheduling (임계경로 탐색과 프로젝트 활동 일정 수립)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.141-150
    • /
    • 2012
  • This paper suggests a critical path search algorithm that can easily draw PERT/GANTT chart which manages and plans a project schedule. In order to evaluate a critical path that determines the project schedule, Critical Path Method (CPM) is generally utilized. However, CPM undergoes 5 stages to calculate the critical path for a network diagram that is previously designed according to correlative relationship and execution period of project execution activities. And it may not correctly evaluate $T_E$ (The Earliest Time), since it does not suggest the way how to determine the sequence of the nodes activities that calculate the $T_E$. Also, the sequence of the network diagram activities obtained from CPM cannot be visually represented, and hence Lucko suggested an algorithm which undergoes 9 stages. On the other hand, the suggested algorithm, first of all, decides the sequence in advance, by reallocating the nodes into levels after Breadth-First Search of the network diagram that is previously designed. Next, it randomly chooses nodes of each level and immediately determines the critical path only after calculation of $T_E$. Finally, it enables the representation of the execution sequence of the project activity to be seen precisely visual by means of a small movement of $T_E$ of the nodes that are not belonging to the critical path, on basis of the $T_E$ of the nodes which belong to the critical path. The suggested algorithm has been proved its applicability to 10 real project data. It is able to get the critical path from all the projects, and precisely and visually represented the execution sequence of the activities. Also, this has advantages of, firstly, reducing 5 stages of CPM into 1, simplifying Lucko's 9 stages into 2 stages that are used to clearly express the execution sequence of the activities, and directly converting the representation into PERT/GANTT chart.

Design for earthquake-resistant short RC structural walls

  • Zygouris, Nick St.;Kotsovos, Gerasimos M.;Kotsovos, Michael D.
    • Earthquakes and Structures
    • /
    • v.8 no.3
    • /
    • pp.713-732
    • /
    • 2015
  • The application of the compressive force path method for the design of earthquake-resistant reinforced concrete structural walls with a shear span-to-depth ratio larger than 2.5 has been shown by experiment to lead to a significant reduction of the code specified transverse reinforcement within the critical lengths without compromising the code requirements for structural performance. The present work complements these findings with experimental results obtained from tests on structural walls with a shear span-to-depth ratio smaller than 2.5. The results show that the compressive force path method is capable of safeguarding the code performance requirements without the need of transverse reinforcement confining concrete within the critical lengths. Moreover, it is shown that ductility can be considerably increased by improving the strength of the two bottom edges of the walls through the use of structural steel elements extending to a small distance of the order of 100 mm from the wall base.

Extracting the K-most Critical Paths in Multi-corner Multi-mode for Fast Static Timing Analysis

  • Oh, Deok-Keun;Jin, Myeoung-Woo;Kim, Ju-Ho
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.6
    • /
    • pp.771-780
    • /
    • 2016
  • Detecting a set of longest paths is one of the crucial steps in static timing analysis and optimization. Recently, the process variation during manufacturing affects performance of the circuit design due to nanometer feature size. Measuring the performance of a circuit prior to its fabrication requires a considerable amount of computation time because it requires multi-corner and multi-mode analysis with process variations. An efficient algorithm of detecting the K-most critical paths in multi-corner multi-mode static timing analysis (MCMM STA) is proposed in this paper. The ISCAS'85 benchmark suite using a 32 nm technology is applied to verify the proposed method. The proposed K-most critical paths detection method reduces about 25% of computation time on average.

A Study on the Fatigue Crack Growth of Cracks in Mechanical Joints (기계적 체결부 균열의 피로균열성장에 관한 연구)

  • 허성필;양원호;정기현
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.10 no.1
    • /
    • pp.187-194
    • /
    • 2002
  • It has been reported that cracks in mechanical joints is generally under mixed-mode and there is critical inclined angle at which mode I stress intensity factor becomes maximum. The crack propagates in arbitrary direction and thus the prediction of crack growth path is needed to provide against crack propagation or examine safety. In order to evaluate the fatigue life of cracks in mechanical joints, horizontal crack normal to the applied load and located on minimum cross section is major concern but critical inclined crack must also be considered. In this paper mixed-mode fatigue crack growth test is performed far horizontal crack and critical inclined crack in mechanical joints. Fatigue crack growth path is predicted by maximum tangential stress criterion using stress intensity factor obtained from weight function method, and fatigue crack growth rates of horizontal and inclined crack are compared.

AN EXAMPLE OF REPRESENTING THREE LEVEL'S SCHEDULES WITHIN SCHEDULE HIERARCHY BY BDM TECHNIQUE

  • Seon-Gyoo Kim
    • International conference on construction engineering and project management
    • /
    • 2011.02a
    • /
    • pp.445-452
    • /
    • 2011
  • The schedule hierarchy in construction project is generally composed of three levels. The highest level is a milestone schedule and represented by Bar Chart format. The middle level is an integrated project schedule (IPS) and represented by CPM (Critical Path Method) format. The lowest level is a detail working schedule and usually represented by Bar Chart. The traditional scheduling techniques such as ADM (Arrow Diagramming Method) or PDM (Precedence Diagramming Method) cannot represent all kinds of schedule within schedule hierarchy as identical schedule format. However, the BDM (Beeline Diagramming Method) technique can represent all kinds of schedule within schedule hierarchy as identical CPM format. This paper describes the basic concept, principle, interpretation methods, and schedule computation methods of the BDM as a new networking technique that can represent all kinds of overlapping relationships between activities, and then presents an example of representing three level's schedules within schedule hierarchy by the BDM technique.

  • PDF

Five-axis finishing tool path generation for a mesh blade based on linear morphing cone

  • Zhang, Rong;Hu, Pengcheng;Tang, Kai
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.4
    • /
    • pp.268-275
    • /
    • 2015
  • Blisk is an essential component in aero engines. To maintain good aero-dynamic performance, one critical machining requirement for blades on blisk is that the generated five-axis tool path should be boundary-conformed. For a blade discretely modeled as a point cloud or mesh, most existing popular tool path generation methods are unable to meet this requirement. To address this issue, a novel five-axis tool path generation method for a discretized blade on blisk is presented in this paper. An idea called Linear Morphing Cone (LMC) is first proposed, which sets the boundary of the blade as the constraint. Based on this LMC, a CC curve generation and expansion method is then proposed with the specified machining accuracy upheld. Using the proposed tool path generation method, experiments on discretized blades are carried out, whose results show that the generated tool paths are both uniform and boundary-conformed.

Design of 4-Layer PCB Considering EMC for Automotive Bluetooth Speaker (차량용 블루투스 스피커를 위한 EMC를 고려한 4층 PCB 설계)

  • Yoon, Ki-Young;Kim, Boo-Gyoun;Lee, Seongsoo
    • Journal of IKEEE
    • /
    • v.25 no.4
    • /
    • pp.591-597
    • /
    • 2021
  • This paper proposes an EMC-aware PCB design method to reduce electromagnetic emission, where trace length and teturn path of critical signal are shortened by changing chip location and trace layout on the PCB, while additional filters or decoupling capacitors are not required. In the proposed method, signal velocity is calculated for various signals on the PCB. Critical signal with the fastest signal velocity is determined and its return path is shortened as much as possible by placing chip location and trace routing first. Return path of critical signal should be carefully designed not to have discontinuity. Power plane and ground plane should be carefully designed not to be divided, since these planes are the reference of return path. The proposed method was applied to automotive directional Bluetooth speaker which failed to pass CISPR 32 and CISPR 25 EMC tests. Its PCB was redesigned based on the proposed method and it easily passed the EMC tests. The proposed method is useful to EMC-sensitive electronic equipments.

A study on critical load due to external force influencing on flight characteristics of a small slender body rocket. (가늘고 긴 소형로켓의 비행특성에 영향을 주는 외력에 기인한 임계하중에 관한 연구)

  • Go, Tae-Sig;Na, Seon-Hwa
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2007.11a
    • /
    • pp.393-397
    • /
    • 2007
  • The aim of this study is to investigate critical load, which can influence on flight path of a small slender body rocket, due to external forces such as thrust, drag and weight. The critical load was firstly obtained from Euler column equation, and compared with analysis results using Finite Element Method to evaluate the theoretical critical load.

  • PDF

AN INTRODUCTION OF NEW SCHEDULING SOFTWARE "BEELINER" BASED ON THE BEELINE DIAGRAMMING METHOD (BDM)

  • Seon-Gyoo Kim
    • International conference on construction engineering and project management
    • /
    • 2013.01a
    • /
    • pp.391-396
    • /
    • 2013
  • As the construction environment has been changing all the times, the techniques for managing the construction projects have been improved accordingly. The schedule management technique, one of the construction management tools, has been evolved as well in order to be adaptable to new construction environment. Most of newly proposed scheduling techniques have been based on the Critical Path Method (CPM) that was proposed in 1956. The CPM is classified into two categories, Arrow Diagramming Method (ADM) and Precedence Diagramming Method (PDM). ADM is so good in the visual format but it cannot express the overlapping relationships between two consecutive activities. On the other hand, PDM can express the overlapping relationships but it is unsatisfactory in the visual format. Recently, as the construction environment becomes more complex and the role of schedule management becomes more and more important, the overlapping expression becomes one of critical factors for scheduling as well. Most of construction project participants prefer more comfortable visual format, however, the scheduling software based on the PDM cannot satisfy their basic requirement. Beeliner, new scheduling software based on the Beeline Diagramming Method (BDM) that was proposed in 2010, was developed in 2012, it can express more flexible overlapping relationships and has superior visual format as well. This paper presents major features and applications of Beeliner, and makes construction professionals understand new scheduling concept and its applications.

  • PDF

Finding the Workflow Critical Path in the Extended Structural Workflow Schema (확장된 구조적 워크플루우 스키마에서 워크플로우 임계 경로의 결정)

  • Son, Jin-Hyeon;Kim, Myeong-Ho
    • Journal of KIISE:Databases
    • /
    • v.29 no.2
    • /
    • pp.138-147
    • /
    • 2002
  • The concept of the critical path in the workflow is important because it can be utilized In many issues in workflow systems, e.g., workflow resource management and workflow time management. However, the critical path in the contest of the workflow has not been much addressed in the past. This is because control flows in the workflow, generally including sequence, parallel, alternative, iteration and so on, are much more complex than those in the ordinary graph or network. In this paper we first describe our workflow model that has considerable work(low control constructs. They would provide the sufficient expressive power for modeling the growing complexities of today's most business processes. Then, we propose a method to systematically determine the critical path in a workflow schema built by the workflow control constructs described in our workflow model.