Task Acceleration
Paying to shorten a task does not necessarily bring a project’s finish forward. This fictional comparison separates purchased task-days from saved…
Estimated reading time: 5 minutes
Paying to shorten a task does not necessarily bring a project’s finish forward. This fictional comparison separates purchased task-days from saved project-days.
Fix the dependency before comparing offers
Two prerequisite tasks start together at day zero. Task A takes twelve days; task B takes eight. A final task takes three days and cannot begin until both prerequisites finish. Baseline completion is therefore day fifteen, not day twenty-three: the first two tasks overlap rather than run consecutively.
Assume deterministic durations, identical completed scope and quality, and no competing resource requirements. Reductions may be fractional days, although the offers below use whole days. The final three-day task cannot be shortened. No additional dependencies, uncertain delays or intermediate deadlines enter this model.
Calculate completion, not the sum of reductions
Let x be the reduction purchased for A and y the reduction purchased for B, with 0 ≤ x ≤ 12 and 0 ≤ y ≤ 8. The prerequisites finish at days 12 − x and 8 − y. The later finish controls when the final task can start:
T(x,y) = max(12 − x, 8 − y) + 3.
Subtract this completion day from the original fifteen. Saved project time is:
S(x,y) = 12 − max(12 − x, 8 − y) = min(x, 4 + y).
The second equality follows by subtracting each candidate prerequisite finish from twelve. Subtracting the larger finish leaves the smaller saving. This also explains the four-day offset: A initially lasts four days longer than B.
With B unchanged, the first four days removed from A each save a project day. Beyond that point, B determines the start of the final task. Reducing B alone saves nothing because A still finishes at day twelve. At x = 4 + y, the prerequisites finish together; shortening only one of them further leaves the other finish unchanged.
For an additional reduction δ in A, where δ ≥ 0 and x + δ ≤ 12, the extra project time saved is min(δ, max(0, 4 + y − x)). The nonnegative inner term is the remaining advantage A can gain before B limits completion; it prevents assigning negative savings after that switch.
Price two offers against their actual completion dates
Suppose one fixed-price offer shortens A by six days for $450. Another shortens B by two days for $100. Stipulate an avoidable expense of $100 for each project day saved. This is an invented cash-cost assumption, not an interest rate, loan quote or promise of actual savings.
Without either offer, completion remains day fifteen and no expense is avoided. Buying only A leaves prerequisite finishes at days six and eight. Completion moves to day eleven: four days are saved, avoiding $400, less the $450 purchase price. The net change is −$50.
Buying only B leaves finishes at days twelve and six. Completion remains day fifteen. No project-day expense is avoided, and the $100 price produces a net change of −$100.
Buying both leaves both prerequisites finishing at day six. Completion becomes day nine, saving six days and avoiding $600. Combined prices are $550, so the stipulated net change is +$50. Eight task-days were purchased, but six project-days were saved.
Evaluate an offer against the correct starting state
The B offer has different incremental effects depending on whether A has already been shortened. Without A’s offer, B saves zero project days. After A’s offer, B moves completion from day eleven to day nine, saving two days. Its conditional avoided expense is $200; subtracting its $100 price gives a +$100 incremental change.
That reconciles the combined result: A alone contributes −$50, then adding B contributes +$100, yielding +$50. Adding the two isolated net changes would instead give −$150. Those isolated calculations both start from the original project; they do not describe successive purchases.
Translate a finish target into two requirements
Now require completion by day ten. The final task still consumes three days, so both prerequisites must finish by day seven. Thus 12 − x ≤ 7 and 8 − y ≤ 7: x must be at least five and y at least one.
Six total task-days of acceleration do not establish compliance with that target. Allocating all six to A leaves completion at day eleven. Allocating five to A and one to B makes both finish at day seven and completes the project at day ten.
More generally, a desired saving d between zero and twelve requires x ≥ d and y ≥ max(0, d − 4). This follows directly from min(x, 4 + y) ≥ d: both entries of the minimum must meet the target. Even eliminating both prerequisites leaves the final three days.
Keep the model separate from an actual schedule
The GAO’s December 2015 Schedule Assessment Guide discusses the longest sequence driving completion and warns that calendars, date constraints and resource arrangements complicate actual schedules. It also emphasizes complete activities, dependencies and current status. The calculations here establish only the consequences of the stated three-task structure. They do not verify a contractor’s durations, resource availability, financing terms or ability to deliver an accelerated project.


