Scribd
Upload
51 views2 pages

Homework # 1:: CPM Pert

The document contains 6 problems related to CPM and PERT network analysis. Problem 1 involves drawing the network and numbering events for a project with 16 activities and specified predecessor relationships. Problem 2 involves drawing the network for a project with 8 activities and given predecessor relationships. Problem 3 requires determining earliest and latest times, floats, and the critical path for a given network. Problem 4 requires determining the critical path, probability of completion, and time for 95% probability of completion for a given network. Problems 5 and 6 require determining optimum schedules and durations that minimize costs based on crash durations and costs for given networks.

Uploaded by

Shivpreet Sharma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
51 views2 pages

Homework # 1:: CPM Pert

The document contains 6 problems related to CPM and PERT network analysis. Problem 1 involves drawing the network and numbering events for a project with 16 activities and specified predecessor relationships. Problem 2 involves drawing the network for a project with 8 activities and given predecessor relationships. Problem 3 requires determining earliest and latest times, floats, and the critical path for a given network. Problem 4 requires determining the critical path, probability of completion, and time for 95% probability of completion for a given network. Problems 5 and 6 require determining optimum schedules and durations that minimize costs based on crash durations and costs for given networks.

Uploaded by

Shivpreet Sharma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 2

Homework # 1: CPM AND PERT

Due Date: February 05, 2018

P1. A project consists of 16 activities having their predecessor relationship as follows:


a) A is the first activity of the project.
b) B, C and D follow A and can be done concurrently.
c) E and G cannot begin until C is completed, and can be performed simultaneously.
d) F is the immediate successor to activities B and E.
e) H and K run in parallel, and both succeed G.
f) L succeeds F and H.
g) I and J are immediate successor activities to activity D.
h) M and N are immediate successor to I and K. However, both M and N can be performed
concurrently.
i) Activities O and P are the last activities. Activity O is the immediate successor to N and L.
Activity P is the immediate successor to M and J.

Draw the network and number the events.

P2. A project consist of eight activities M, N, O, P, Q, R, S and T. Draw the network if:
a) Activities M, N and Q can start concurrently.
b) Activities O and P are concurrent, and depend on the completion of both M and N.
c) Activities R and S are concurrent, and depend on the completion of O.
d) Activity T depends upon the completion of P, Q and R.
e) The project is complete when S and T are done.

P3. The network of a certain project is shown Fig. 1 with the estimated durations of various activities.
Determine the following:
a) Earliest event time and latest
event time.
b) Earliest and latest start and
finish times of each activity.
c) Total and free floats for each
activity.
d) Critical path for the network.

Figure 1

P4. Fig. 2 shows the network for a construction project, with the three time estimate of each activity
marked. Determine
a) Critical path and its standard deviation.
b) Probability of completion of project in 40 days.
c) Time duration that will provide 95% probability of its completion in time.

CE:318/Vaibhav Singhal/Sem-II 2018


Figure 2

P5. For the given CPM network in Fig. 3, all normal direct cost of the project is Rs. 37,500 and
indirect expenses are Rs.250/day.
a) Find all possible schedules
b) Select the optimum and minimum (all crash) duration of the project.

(The value of normal duration, crash duration and cost slope of each activity marked on the
arrow diagram).

Figure 3

P6. Fig. 4 shows the network for a project, the data


for the duration and costs of each activity are
given in the below table. The direct cost of the
project is Rs. 3000 per week. Determine the
optimum duration of the project and the
corresponding minimum cost. Draw the time
scaled version of the network at each stage of
crashing.

Figure 4

Normal Duration Crash duration Crash cost


Activity Normal Cost (Rs)
(Weeks) (weeks) (Rs)
1-2 6 7000 3 14500
1-3 8 4000 5 8500
2-3 4 6000 1 9000
2-4 5 8000 3 15000
3-4 5 5000 3 11000

CE:318/Vaibhav Singhal/Sem-II 2018

You might also like