 I am Mr. Satish Thalangi, Assistant Professor, Department of Civil Engineering, Washington Institute of Technology, Solapo. In today's session, we are going to see the program evaluation and review technique for the project management. It is also known as a PIRT for the project management. The learning outcome. The students will be able to compare the program evaluation review technique with the particular CPM network technique of the particular project for the project management. The PIRT, the PIRT is, it is also a graphical and logical representation of the project and its activities. It was developed by the U.S. Navy. And usually it is used for the new type of projects or you can say the R&D or you can say research types of projects. It is an event-oriented network technique. It is a, as it is an event-oriented network technique where particularly it is a deterministic or a probabilistic type of technique it is. It is represented by the AOA type of network. And in the PIRT, we usually see the three times of which we use for the finding of the expected time finally. Here in the PIRT, there is a slack. And with the help of slack, we are going to define whether the particular event is a critical one or non-critical one. With the help of this, we are going to define the critical path and after with the help of critical path, we will define the project duration of particular project. Here, the particular time estimates in the PIRT. The time estimates are the estimates which are, means with the help of the beta distribution curve, we are going to define the three time estimates. Usually, if we consider a single activity, the particular activity can be complete in the prismatic time. It is time or you can say it is a condition that is here, the favorable condition is there and it is a minimum time required for the completion of particular activity. And the most likely time. The most likely time is a time when the particular condition is a normal one and it is a normal time required for the completion of the particular activity. And the prismatic time is a time when the particular condition is unfavorable one and it is a maximum time required for the completion of the particular activity. With the help of all these three activity, we are going to define the expected time of the particular each activity. And with the help of this expected time, finally we are going to define the project duration of particular project. Here, this is a formula which is used for the defining the particular expected time of each activity, which is equal to a particularly optimistic time plus four into most likely time plus prismatic time divided by six. This is a beta distribution curve or it is also known as a probability distribution curve. Yeah, it is a particularly prismatic time. This is a most likely time of the particular activity and this is a prismatic time of the particular activity. Yeah, on the particularly, when we see the this curve, yeah, the most or you can say the most expected, you can say the most likely time which is closer to the expected mean time. This is a particularly beta distribution curve which is used to define the times of each activities. Now, expected time estimation of the activities. As we have seen in the earlier side, the formula which is used for to define the expected time of each activity. The activity A, B, C are here. There are the three times of the particular each activity that is here. This is three, five, seven. This is a three is a particularly optimistic time, five is a most likely time and seven is a prismatic time. With the help of these three times, we are going to define the particular expected time of each activity. Yeah, with these, these are the particularly values or for values of the each each activities that is five, eight and nine, which is obtained with the help of the formula of the expected time. After getting this, we are going to calculate the particularly a project duration or you can say the project duration of the particular project. Yeah, the event times. The event times are the particularly when we observe these are the yellow color box which are representing the event times. In this, the event is first, this is capital T E. This is the earliest expected time which is forward move from the left hand side to the right hand side. And the time calculated is from the left hand side to the right hand side. And there are the latest unavailable occurrence times that is which is mentioned below the nodes that is capital T L, which is calculated from the, which is calculated from moving from particularly right hand side to the left hand side. Yeah, as we see the time calculation, zero plus five, five, five plus eight, 13, 13 plus nine, 22. Similarly, when we move from the right hand side to the left hand side, 12, 22 minus nine, 13, 13 minus eight, five, five minus five, zero. This is a particularly event times. Now this is overall representation of event and the activity time for the network. Here we see all the event time of each event as well as the activity times of each activities. This is a particular network diagram which is representing both the times. Yes, yeah, as we have seen in the earlier slide, we are going to move from the left hand side to the right hand side for the forward path and from the particularly right hand side to the left hand side, which is called the backward path. In this particular network diagram, the forward path is represented by the black arrows and the particular backward path is represented by the red arrows. While moving from the left hand side to the right hand side, we consider the maximum durations for the next activity starting and similarly, when we move from the right hand side to the left hand side, we consider the minimum times for the activity as late as its finish and we move from right hand side to the left hand side for the backward path. This is overall network diagram which is representing the forward path and the backward path. Now this is a slack of the activity. As we have seen in the CPM, there is a float in the particular part, there is a slack. The slack is a flexible range of the time that an event in a project network can delay without affecting the overall project duration. It is obtained, the value of the slack is obtained by the difference between the latest allowable occurrence time and the earlier expected time. In this network diagram, the LO box are representing the earliest expected time as well as the latest allowable occurrence times. When we see the difference between the particular, both the event times, we will get whether the particular activity is having slack zero or more than zero, on which we can define that the particular event is a critical one or non-critical one. This is slide where we are representing the particularly calculations for the slack times of each events. Here when we see the particularly first event, it is zero minus zero, it is zero. So here the first as it is starting, it is a critical one. And when we see event two, the particularly latest allowable occurrence time is particularly five. And the earliest expected time is five, five minus five, again it is zero. So that's why we are representing as a critical event. But when we see the event number four, where the four, when we see the particularly latest allowable occurrence time is 19, but the earlier expected time is nine, 19 minus nine, it is 10. Means this particular activity is non-critical, particular event is non-critical one and it can be delayed as per the value which is obtained by the difference. That is up to 10 days we can delay a particular event. This is overall network diagram and this red colors are representing the particularly arrows which is a forward path. And when we see the project particularly, project duration is 22 days. This is the table which is representing the events and its particular slacks. The red color or the red color events are the critical one and the black color is a non-critical one. And in today's question, now let's we construct the particular, you can say the per diagram for the, per network diagram for the particular problems. These are the three events of each activities. These are the description which are defining the interdependency between the each activities. This table is representing the expected time which is obtained by the formula as we have seen earlier. With the help of this particular data, the particular network diagram is constructed. And with the help of this, we are defining each activities, durations as well as the events, slacks. Now, here in this project, the particular critical path one is when we see in the event time one, three and four and the project duration is eight days. Now, this is a comparison between the particular part and the CPM. There are two to three main major points which are the difference between the CPM and the part. The part is the particularly event orientation type of network diagram and the CPM is activity orientation orientation type of network diagram. Here the slack is present in the part and here the float is present in the CPM. Here it is a indeterminance type of technique approach here and it is a determinance type of technique. Here we define the critical path with the help of the events. Here we define the critical path with the help of the activities. These are the major points in the major points between difference between the particularly part and the CPM. Now, these are the references for the today's session. Thank you.