Scribd
Upload
268 views

Questions On Network Problems

The document contains two questions regarding network project management: 1) For a hospital renovation project, the respondent is asked to draw a network diagram, calculate expected times and variances for activities, and estimate the probability of completing the project within 60 days given the activity information provided. 2) For a separate project, the respondent is provided normal and crash times and costs for each activity. Crash times are the shortest possible times given extra resources. The respondent is asked to determine how much each activity should be shortened to complete the project within 26 days at minimum extra cost.

Uploaded by

Kenneth Rono
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
268 views

Questions On Network Problems

The document contains two questions regarding network project management: 1) For a hospital renovation project, the respondent is asked to draw a network diagram, calculate expected times and variances for activities, and estimate the probability of completing the project within 60 days given the activity information provided. 2) For a separate project, the respondent is provided normal and crash times and costs for each activity. Crash times are the shortest possible times given extra resources. The respondent is asked to determine how much each activity should be shortened to complete the project within 26 days at minimum extra cost.

Uploaded by

Kenneth Rono
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Questions on Network problems

1. A project designed to refurbish a hospital operating theatre consists of the following activities, with estimated times and precedence relationships shown. Using this information draw a network diagram, determine the expected time and variance for each activity, and estimate the probability of completing the project within sixty days. Activity A ) . / 1 3 Immediate redecessors % % A ) ), . / !ptimistic "ime & 1* 1 ,& ' #ost $ikely "ime ' 1+ , 0 +' 0 !ptimistic "ime ( ,1& 1' 21 1-

,. An activity has these time estimates4 optimistic time o 5 1& weeks, most likely time m 5 ,* weeks, and pessimistic time p 5 ,, weeks. a6 calculate the activity7s expected time or duration t. b6 calculate the activity7s variance v. c6 calculate the activity7s standard deviation. +. A project has the following activities, precedence relationships, and time estimates in weeks4 Activity A ) . / 1 3 8 a6 b6 c6 d6 e6 Immediate redecessors % % A ) ) 1 / !ptimistic "ime 1& ,& 1& ,, 1& ,* #ost $ikely "ime ,* 1* +* 1& ,& ,* ,* !ptimistic "ime ,& 1, 2* 1& ,( ,, ,,

.alculate the expected time or duration and the variance for each activity. .onstruct the network diagram "abulate the values of 19,13,$9,$3 and slack for each activity Identify the critical path, and the project duration. :hat is the probability that the project will take longer than &( weeks to complete;

2. "he project detailed below has the both normal costs and <crash< costs shown. "he crash time is the shortest possible activity time given that extra resources are allocated to that activity.

Activity A ) . / 1 3 8

Immediate redecessors % A ) ) . ., / 1, 3

=ormal "ime & , + 0 ( 2

=ormal "ime .ost >?6 , *** + *** 1 *** 2 *** & *** 2 &** , ***

.rash "ime 2 ' , , ' & ,

.rash "ime .ost >?6 ' *** ' *** 1 *** ' *** - *** ' *** & ***

Assuming that the cost per day for shortening each activity is the difference between crash costs and normal costs, divided by the time saved, determine by how much each activity should be shortened so as to complete the project within twenty%six days and at the minimum extra cost.

You might also like