retagged by
1,663 views
2 votes
2 votes

A software project has four phases P1, P2, P3 and P4. Of these phases, P1 Is the first one and needs to be completed before any other phase can commence. Phases P2 and P3 can be executed in parallel. Phase P4 cannot commence until both P2 and P3 are completed. The optimistic, most likely, and pessimistic estimates of the phase completion times in days, for Pl, P2, P3 and P4 are, respectively, (11, 15, 25), (7, 8, 15), (8, 9, 22), and (3, 8, 19).

The costs (in Rupees per day) of crashing the expected phase completion times for the four phases, respectively, are 100, 2000, 50, and 1000. Assume that the expected phase completion times of the phases cannot be crashed below their respective most likely completion times. The minimum and the maximum amounts (in Rupees) that can be spent on crashing so that ALL paths are critical are, respectively.

  1. 100 and 1000
  2. 100 and 1200
  3. 150 and 1200
  4. 200 and 2000
retagged by

2 Answers

Best answer
3 votes
3 votes

First calculate Estimated time Using formula :
estimated=(optimistic+4*most likely+pessimistic)/6

so

P1=16

p2=9

p3=11

p4=9

To determine the Critical Path and conduct Critical Path Analysis, you need to:

  1.  create a Precedence Diagram.
  2. Define the duration of each activity.
  3. Identify all the paths.
  4. Calculate the duration of each path.
  5. Identify the longest path.

Here P1-P3-P4 is the longest path so it is critical path

Slack of an activity is the duration that it can slip by without delaying the subsequent task or completion of the project, or violating schedule constraint.

The simple 3-step process to calculate slack of ALL activities in your schedule network diagram –

Step 1: Arrange the paths in decreasing order of their total duration, starting with Critical path

P1+p3+p4=76

p1+p2+p4=74

Step 2: Find float for activities on the second longest path

This would be the difference between total duration of critical path and next longest path. In our example this would be               76-74=2 minutes. Assign this to ALL activities on this path, which do not already have a float. In this example that would be only activity.

Step 3: Do the same to all remaining paths, for unassigned activities

so slack time of p2=2

Refrence:http://www.pmexamsmartnotes.com/how-to-calculate-critical-path-float-and-early-and-late-starts-and-finishes/2/

The remaining part of question is ambiguous since crash times are not given

selected by
0 votes
0 votes

Ans D:   Explanation: Critical task is the one on longest path intermediate task:P3
 

Answer:

Related questions

0 votes
0 votes
1 answer
2
Ishrat Jahan asked Nov 1, 2014
1,311 views
void swap(float* A1, float* A2) { float temp; if (*A1 = = *A2) return; temp = *A1; *A1 = *A2; *A2 = temp; return; }The program volume for the above module using Halstead'...
0 votes
0 votes
2 answers
4
Ishrat Jahan asked Nov 1, 2014
1,135 views
void swap(float* A1, float* A2) { float temp; if (*A1 = = *A2) return; temp = *A1; *A1 = *A2; *A2 = temp; return; }The program effort for the above module using Halstead'...