• Title/Summary/Keyword: PERT 차트

Search Result 3, Processing Time 0.016 seconds

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

A Use-Case Based Object-Oriented Project Scheduling Technique (Use-Case 기반 객체지향 프로젝트 스케줄링 기법)

  • 허진선;최시원;김수동
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.3_4
    • /
    • pp.293-307
    • /
    • 2003
  • Object-oriented development has been generalized, but object-oriented project planning and scheduling techniques have not been studied enough. Furthermore, it is difficult to apply the conventional software management techniques to object-oriented projects. Especially, the large scaled projects are increasing, but the project planing techniques for these large scaled projects have not been proposed enough. In this paper, we propose systematic techniques for OO based project scheduling. We suggest a 7 step-process for deriving the OO project schedule from the use-case diagram which is describing the functional requirements of the system. The proposed process includes identifying use-cases, drawing preliminary chart through interdependency analysis, identifying characteristics of each use case, determining the number of iteration, assigning use-cases to iteration, considering available resource and constraints, drawing revised PERT chart. Each step has the explanation of the input, output, and the guidelines needed to perform the step. The project scheduling technique proposed in this paper ran be used effectively in the planning phase which the purpose is to plan a development schedule to yield the high quality software in minimum time.

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.