• Title/Summary/Keyword: PERT 네트워크

Search Result 12, Processing Time 0.021 seconds

Sensitivity Analysis of Expected Project Completion Time in a PERT Network with Discrete Distributions (이산형 활동시간 분포를 갖는 PERT 네트워크에서 평균사업완성시간과의 민감도 분석)

  • Cho, Jae-Gyeun;Park, Chul-Jae
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.12 no.1
    • /
    • pp.108-117
    • /
    • 2007
  • For a PERT network the sensitivity analyses are valuable tools for effective management and control of a project. In a previous article, a method was developed for the sensitivity analysis of the expected project completion time (${\mu}_{T}$) with respect to the expected duration of an activity (${\mu}_{i}$) under the assumption that the durations of activities are independent and normally distributed. In the present article, a method is presented for the sensitivity analysis of ${\mu}_{T}$ with respect to ${\mu}_{i}$ when the durations of activities are independent and follow discrete distributions, which utilizes the previous sensitivity analysis method with modifications. The accuracy of the proposed method is assessed using various example PERT networks, and the computational results indicate that the accuracy is comparable to that of direct Monte Carlo simulation.

  • PDF

Probability-based Critical Path Estimation for PERT Networks of Repetitive Activities (반복작업 PERT 네트워크의 확률기반 주공정 산정기법)

  • Yi, Kyoo-Jin
    • 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.

An Investigation of Project Completion Time Estimation Method in PERT Network for Planning and Management in Large-Scale Systems (대규모 시스템의 모사와 관리를 위한 PERT네트워크 완료일자 추정기법에 관한 고찰)

  • Lee, Jae-Myung;Yi, Ho-Jae;Park, Mee-Jeong;Lee, Jeong-Jae
    • Proceedings of the Korean Society of Agricultural Engineers Conference
    • /
    • 2005.10a
    • /
    • pp.695-699
    • /
    • 2005
  • Propriety of PERT network for planning and management in large-scale systems was investigated. We also review the example of small and middle size system to compare the appropriateness of PERT analysis method. For comparing the appropriateness of PERT analysis method the calculation time, and the variances were estimated. Eventualy, we proposed the criteria of PERT analysis method for planning and management large-scale systems.

  • PDF

PERT와 CPM을 이용한 인공위성 개발 프로젝트 일정계획에 관한 연구

  • Kim, Hyeong-Wan;Choe, Jeong-Su;Park, Jong-Seok
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.37 no.2
    • /
    • pp.174.1-174.1
    • /
    • 2012
  • 현재 인공위성 개발 프로젝트들을 계획하고 일정계획을 수립하기위해 간트차트가 널리 활용되고 있다. 간트차트는 프로젝트의 각 작업들이 언제 시작하고 종료되는지에 대한 작업 일정을 막대 도표를 이용하여 표시하는 프로젝트 일정표로 다양한 형태로 변경하여 사용할 수 있으나 작업경로를 표시할 수 없으며 계획의 변화에 대한 적응성이 약한 단점이 있다. 또한 일목요연하게 눈으로 보여줄 수 있으나 효과적인 프로젝트 관리에 중요한 활동 사이의 어떤 관계에 대한 정보를 주지 못한다. 인공위성개발과 같은 복잡한 프로젝트에 대해 간트차트와 더불어 PERT(Program evaluation and review technique)와 CPM(critical path method)과 같은 네트워크 도(Network Diagram)와 함께 사용될 수 있도록 그 이론과 활용방안에 대해 기술하고자 한다. PERT와 CPM은 큰 프로젝트를 계획하고 조정하기 위해 폭넓게 사용되는 두 가지 기법이다. PERT와 CPM을 사용하면 프로젝트 활동에 대한 그래프를 통한 도시, 프로젝트 소요시간 추정, 프로젝트 완료시간 준수를 위해 중요한 활동의 식별, 전체 프로젝트에 대한 지연 없이 가능한 각 활동의 지연시간 추정과 같은 이점이 있다. PERT와 CPM은 독립적으로 개발되었지만, 많은 공통점이 있다. 더 나아가서 둘 사이에 원래 존재했던 차이점은 많은 부분은 서로의 특징을 도입하면서 거의 사라졌다. 실제적으로 볼 때, 두 기법은 지금 같은 기법이며, 기술된 특징과 절차는 PERT분석 뿐 아니라 CPM 분석에도 적용될 수 있을 것이다.

  • PDF

Control Variates for Percentile Estimation of Project Completion Time in PERT Network (통제변수를 이용한 PERT 네트워크에서 프로젝트 완료확률의 추정)

  • 권치명
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.4
    • /
    • pp.67-75
    • /
    • 2000
  • Often system analysts are interested in the estimation of percentile for system performance. For instance, in PERT network system, the percentile that the project. Typically the control variate method is used to reduce the variability of mean response using the correlation between the response and the control variates with a little additional cost during the course of simulation. In the same spirit, we apply this method to estimate the percentile of project completion time in PERT system, and evaluate the efficiency of the controlled estimator for its percentile.1 Simulation results indicate that the controlled estimators are more effective in reducing the variances of estimators than the simple estimators, however those tend to a little underestimate the percentiles for some critical values. We need more simulation experiments to examine such a kind of bias problem. We expect this research presents a step forward in the area of variance reduction techniques of stochastic simulation.

  • PDF

Establishing Model of Optimized Collaboration Procedure using PERT/CPM (PERT/CPM을 이용한 최적화된 협업 프로세스 수립 모형)

  • Lim, Yousup;Chang, Young-Hyeon;Kim, Seunghee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.1
    • /
    • pp.173-183
    • /
    • 2018
  • It is a very difficult task to establish a collaborative procedure in a new business that requires multilateral collaboration or to revise the regulation by analyzing and proving objectively the problems in the collaborative process conducted already by multilateral collaboration. In this paper, we proposed an optimization model for collaborative process to establish the operation procedure between collaborative parties using PERT/CPM network diagram which allows us to calculate the processing time. In order to verify the effectiveness and usefulness of our model for the collaboration process optimization developed in this study, we applied the developed collaborative procedure to student selection of the work-and-study-in-parallel course associated with a degree executed by Ministry of Employment and Labor. This study can be useful not only for newly establishing or reconfiguring collaborative procedures but also for standardizing the business procedures for building information systems between collaborative organizations.

On Identification of Discrete System Expressed by Network Model (네트워크형 이산 시스템의 동정에 관하여)

  • 석상문;강기중;이철영
    • Journal of Korean Port Research
    • /
    • v.14 no.2
    • /
    • pp.155-163
    • /
    • 2000
  • A discrete system has interpreted by using the network model, and PERT network is one of these methods. For the purpose of analysing the real system, it is necessary to measure the parameter of the real system. And system identification problem is to assume the parameter of a real system when we get to know the system model, the input data and output data. System identification method has been only developed to a system of which a structure has expressed a differential equation or a polynomial expression. But it has been scarcely developed yet in that case of network model. The aim of this paper is to examine a changes when new system is introduced to the present system. The changes are as follows : how the present system will be changed, when the changes will be happened. In this paper, genetic algorithm is used to assume the parameter.

  • PDF

On Identification of discrete system expressed by Network Model (네트워크형 이산 시스템의 동정에 관하여)

  • 석상문;강기중;이철영
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 1999.10a
    • /
    • pp.101-108
    • /
    • 1999
  • A discrete system has interpreted by using the network model, and PERT network is one of these methods. For the purpose of analysing the real system. it is necessary to measure the parameter of the real system. And system identification problem is to assume the parameter of a real system when we get to know the system model, the input data and output data. System identification method has been only developed to a system of which a structure has expressed a differential equation or a polynomial expression. But it has been scarcely developed yet in that case of network model. The aim of this paper is to examine a changes when new system isn introduced to the present system, The changes are as follows: how the present system will be changed, when the changes will be happened. In this paper, genetic algorithm is used to assume the parameter.

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.

A Network Optimization Model for Strategic Itinerary Planning of Cruise Fleet (크루즈 선대의 운항일정계획을 위한 네트워크 최적화 모형)

  • Cho, Seong-Cheol;Won, You-kyung;Kim, Jung-Hyeon
    • Journal of Navigation and Port Research
    • /
    • v.36 no.1
    • /
    • pp.51-58
    • /
    • 2012
  • In spite of today's rapid growth of world cruise industry, little academic attention has yet been given to the decision making problems for cruise operations. This research deals with strategic cruise itinerary planning that any cruise company should face. Increasing demands for international itineraries and redeployments of cruise ships are adding complexity to the itinerary planning. A slight modification of the conventional PERT/CPM network is adopted. to cope with this complexity systematically. By this, the concept of candidate itinerary network is suggested for each cruise ship. To integrate these candidate itinerary networks for each ship in a single framework, an integer programming model has been developed to find the optimal itinerary planning for any fleet of cruise ships. A numerical example, based on real cruise itinerary practices, is tested to validate and interpret the model.