1 / 20

Activity networks – Example 1

Activity networks – Example 1. The table below shows the tasks involved in a project, with their durations and immediate predecessors. Draw an activity network and use it to find the critical activities and the minimum duration of the project. 1. Activity networks – Example 1. A(3). B(4).

ocean
Download Presentation

Activity networks – Example 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Activity networks – Example 1 The table below shows the tasks involved in a project, with their durations and immediate predecessors. Draw an activity network and use it to find the critical activities and the minimum duration of the project.

  2. 1 Activity networks – Example 1 A(3) B(4) C(6) First draw a start node labelled 1. Activities A, B and C do not depend on any other activity, so they all begin at node 1.

  3. 2 Activity networks – Example 1 D(5) A(3) 1 B(4) C(6) Activity D depends on A, so add event node 2 at the end of A. Now add activity D.

  4. 3 Activity networks – Example 1 D(5) 2 A(3) E(1) 1 B(4) F(6) C(6) Activities E and F both depend on B, so add event node 3 at the end of B. Now add activities E and F.

  5. E(1) C(6) B(4) F(6) E(1) B(4) C(6) 3 3 F(6) Activity networks – Example 1 D(5) 2 A(3) 1 Activity G depends on C, D and E, so all these three events need to end at the same node. This is easiest if you redraw the network so that C is between A and B.

  6. 4 C(6) E(1) B(4) 3 F(6) Activity networks – Example 1 D(5) 2 D(5) A(3) G(7) 1 Now add node 4, with C, D and E leading into it. Now add activity G.

  7. 4 5 3 Activity networks – Example 1 2 D(5) A(3) G(7) 1 C(6) G(7) E(1) B(4) F(6) F(6) A finish node is now needed. Any activities not leading into a node must end at the finish node.

  8. 4 5 3 Activity networks – Example 1 2 D(5) A(3) 1 C(6) G(7) E(1) B(4) F(6) The next step is to find the early event times (EETs). An EET is the earliest time that an event (denoted by the numbered nodes) can occur. The event cannot occur until all activities leading into the event node have finished.

  9. 4 5 3 Activity networks – Example 1 2 D(5) A(3) 1 C(6) G(7) 0 E(1) B(4) F(6) Event 1 occurs at time zero.

  10. 4 5 3 Activity networks – Example 1 3 2 D(5) A(3) 1 C(6) G(7) 0 E(1) B(4) F(6) Event 2 cannot occur until A is finished. The earliest time for this is 3.

  11. 5 4 3 Activity networks – Example 1 3 2 D(5) A(3) 1 C(6) G(7) 0 E(1) B(4) F(6) 4 Event 3 cannot occur until B is finished. The earliest time for this is 4.

  12. 4 5 3 Activity networks – Example 1 3 2 D(5) A(3) 8 1 C(6) G(7) 0 E(1) B(4) F(6) 4 Event 4 cannot occur until C, D and E are all finished. So the earliest time for event 4 is 8. The earliest C can finish is 6. The earliest D can finish is 3 + 5 = 8. The earliest E can finish is 4 + 1 = 5.

  13. 5 4 3 Activity networks – Example 1 3 2 D(5) A(3) 8 1 C(6) G(7) 0 E(1) B(4) F(6) 15 4 Event 5 cannot occur until F and G are both finished. So the earliest time for event 5 is 15. The earliest F can finish is 4 + 6 = 10. The earliest G can finish is 8 + 7 = 15.

  14. 4 5 3 Activity networks – Example 1 3 2 D(5) A(3) 8 1 C(6) G(7) 0 E(1) B(4) F(6) 15 4 The next step is to find the late event times (LETs), working backwards through the network. A LET is the latest time that an event can occur without delaying the project. The LET is found by finding the latest time that each activity leading out of the event can begin – the LET is the earliest of these.

  15. 4 5 3 Activity networks – Example 1 3 2 D(5) A(3) 8 1 C(6) G(7) 0 E(1) B(4) F(6) 15 15 4 Event 5 must occur by time 15, or the project will not finish in the minimum possible time.

  16. 5 4 3 Activity networks – Example 1 3 2 D(5) A(3) 8 8 1 C(6) G(7) 0 E(1) B(4) F(6) 15 15 4 The only activity leading from event 4 is G, which must start by time 8 if the project is not to be delayed. So event 4 must occur by time 8.

  17. 5 4 3 Activity networks – Example 1 3 2 D(5) A(3) 8 8 1 C(6) G(7) 0 E(1) B(4) F(6) 15 15 4 7 The activities leading from event 3 are E (which must start by time 7) and F (which must start by time 9). So event 3 must occur by time 7.

  18. 5 4 3 Activity networks – Example 1 3 3 2 D(5) A(3) 8 8 1 C(6) G(7) 0 E(1) B(4) F(6) 15 15 4 7 The only activity leading from event 2 is D, which must start by time 3. So event 2 must occur by time 3.

  19. 5 4 3 Activity networks – Example 1 3 3 2 D(5) A(3) 8 8 1 C(6) G(7) 0 0 E(1) B(4) F(6) 15 15 4 7 Finally, event 1 must occur by time zero.

  20. 5 4 3 Activity networks – Example 1 3 3 2 D(5) A(3) 8 8 1 C(6) G(7) 0 0 E(1) B(4) F(6) 15 15 4 7 The critical activities are the activities (i, j) for which the LET for j – the EET for i is equal to the activity duration. The completed network shows that the project can be completed in 15 hours. The critical activities are A, D and G. For analysis of the float in this example, see the Notes and Examples.

More Related