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 an office relocation. 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 C is to be shortened by 2 days

Activity-on-arrow network. Nodes are events. Event order: [2 | 3 | 5 | 6 | 7 | 4 | 8]. Full activity list: C: 2 to 3, 8 days, solid; D: 3 to 5, 2 days, solid; E: 5 to 4, 7 days, solid; F: 3 to 6, 5 days, solid; G: 6 to 4, 4 days, solid; H: 3 to 7, 8 days, solid; I: 7 to 4, 6 days, solid; J: 4 to 8, 5 days, solid.C (8 days)D (2 days)E (7 days)F (5 days)G (4 days)H (8 days)I (6 days)J (5 days)2356748
Complete baseline activity data
ActivityFrom eventTo eventBaseline duration (days)Maximum reduction (days)Added cost per reduced period
C2382$90
D3521$60
E5470not available
F3650not available
G6440not available
H3780not available
I7460not available
J4850not available
(a)2 marks

Record the whole-period reduction for each listed crashable activity

(b)1 mark

State the recalculated project duration