Page 145 - DCAP601_SIMULATION_AND_MODELING
P. 145

Sandeep Kumar, Lovely Professional University
                                                                               Unit 9: Simulation of a PERT Network (I)



                       Unit 9: Simulation of a PERT Network (I)                                   Notes



              CONTENTS
              Objectives
              Introduction
              9.1  Network Model of a Project
              9.2  PERT/CPM for Project Scheduling & Management

                   9.2.1 Brief History of CPM/PERT
                   9.2.2 Planning, Scheduling & Control
                   9.2.3 The Framework for PERT and CPM
                   9.2.4 Drawing the CPM/PERT Network
                   9.2.5 Expected Length of a Project
                   9.2.6 Probability of Project Completion by Due Date
              9.3  Program Evaluation Review Technique (PERT)
                   9.3.1 Principle
                   9.3.2 Achievement

                   9.3.3 Uncertainty in Project Scheduling
              9.4  Critical Path Method (CPM)
              9.5  Analysis on Activity Network
              9.6  Summary
              9.7  Keywords
              9.8  Self Assessment
              9.9  Review Questions

              9.10 Further Readings



            Objectives

            After studying this unit, you will be able to:

               Describe network model of a project
               Discuss the analysis of pert network

            Introduction

            Wherever the hierarchical database model structures data as a tree of records, with each record
            having one parent record and many children, the network model allows each record to have
            multiple  parent and child records, forming a comprehensive graph  structure. This property
            applies at two levels: The schema is a generalized graph of record types connected by relationship
            types (called “set types” in CODASYL), and the database itself is a generalized graph of record
            occurrences connected by relationships (CODASYL “sets”). Cycles are permitted at both levels.




                                             LOVELY PROFESSIONAL UNIVERSITY                                  139
   140   141   142   143   144   145   146   147   148   149   150