Search topics

Search
1 of 8 0-day streak

Reduce project duration subject to crash limits and costs

DIFFICULTYintrostandardchallengeexam
QUESTION TYPEMix of allChange
newDuration; two route; unique longest path setnewDuration; three route; unique longest path setNOWMix of allRecommended
Question 1 of 8

Calculator allowed

Consider this activity-on-arrow network for a festival site preparation. Nodes are events. Solid arrows are activities. Each edge label gives the baseline activity duration in days

A reduction shortens an activity by a whole number of stated periods. Recalculate every source-to-finish path after each reduction, then total each reduced activity's cost once

Activity G is to be shortened by 1 day

Activity-on-arrow network. Nodes are events. Event order: [11 | 12 | 14 | 15 | 16 | 13 | 17]. Full activity list: E: 11 to 12, 5 days, solid; F: 12 to 14, 12 days, solid; G: 14 to 13, 2 days, solid; H: 12 to 15, 7 days, solid; I: 15 to 13, 2 days, solid; J: 12 to 16, 8 days, solid; K: 16 to 13, 2 days, solid; L: 13 to 17, 5 days, solid.E (5 days)F (12 days)G (2 days)H (7 days)I (2 days)J (8 days)K (2 days)L (5 days)11121415161317
Complete baseline activity data
ActivityFrom eventTo eventBaseline duration (days)Maximum reduction (days)Added cost per reduced period
E111250not available
F1214120not available
G141321$105
H121572$50
I151320not available
J121680not available
K161320not available
L131750not available
(a)2 marks

Enter the reduction for each activity with a permitted crash limit

(b)1 mark

What is the new project completion time?