An RFP critical-path analysis calculates the chain or chains that determine the earliest forecast completion of the remaining bid work under stated dependencies, durations, calendars and resource availability. Its output is a versioned network and decision record, not a list of important questions. It identifies the finish milestone, driving activities, near-driving branches, usable timing flexibility, unresolved assumptions and interventions whose effect has been recalculated. A forecast is conditional on its inputs; it neither guarantees submission nor authorizes the actions shown in the plan.

The response team adds a writer to the longest answer. That answer finishes earlier, but the final package does not: a partner schedule still feeds the price review, and the review must finish before the offer can be reconciled. Meanwhile, the evidence branch has quietly used its remaining allowance. A board full of earlier personal deadlines gives management no reliable account of what will move the submission date.

Trace what controls the finish before asking everyone to work faster. This dossier starts with a controlled work breakdown, accepted owner assignments and duration evidence. It calculates dependencies and timing rather than recreating the effort estimate, choosing answer owners or making the overall late-bid rescue decision. The English example is a fictional service bid with two converging branches. The German and French editions develop different cases. Source references were checked on 6 September 2026; the scheduling method is applied to bid production, not presented as a universal procurement rule.

Name the event the network is supposed to finish

A completed draft, an approved offer and a recorded submission are different events. Define the terminal milestone precisely enough that a person outside the writing team can inspect its evidence. If the analysis stops at release-ready files, call it the path to release readiness and retain the separate delivery plan. If it claims to cover submission, include the required preparation, authorized sending and confirmation steps. A final manuscript alone cannot prove that whole path.

Keep three times visible: the calculated forecast, the internal target and the buyer’s controlling deadline. Preserve the official source, lot, response stage and time-zone basis of the last one. Derive the internal target from the remaining delivery operations and the reserve the authorized team has chosen. Do not move the buyer deadline to make the model fit, or quietly turn an internal target into a buyer requirement.

Public Services and Procurement Canada’s preparation reference tells suppliers to inspect pre-closing deliverables, closing time and the stated submission method. Its scope is Canadian federal opportunities. Here it supports a specific intake check: include the applicable delivery events before declaring the network complete. It does not set a universal upload allowance or validate another buyer’s procedure.

Fix a status instant for the calculation. Completed work needs an observed completion record and the correct version; unfinished work needs a remaining duration. A review completed on yesterday’s price file may be reopened by a changed price. Preserve the earlier review as history, but do not use it as a completed predecessor for the revised offer unless its authority confirms that it still applies.

Calculate both branches before deciding where to intervene

Fictional Brackenmere Service Systems has eight remaining activities for one bid. All prerequisites outside the table are assumed complete and accepted at time 0. Time is measured at working-day boundaries on one agreed calendar: a two-day activity starting at 3 finishes at 5. There are no holidays, resource conflicts, additional waiting periods or overlaps in this teaching model. Durations are scenario assumptions, not benchmarks for real bids.

The evidence branch is A, four days to obtain the specified authorized evidence; B, one day to validate it; and C, two days to complete the technical answer. The commercial branch is D, three days for a defined partner input, followed by E, two days for its cost check. F reconciles both accepted branches in one day. G takes one day to produce the approved release-ready package. H takes two working days for the separately authorized delivery and confirmation process. Its completion condition is the procedure-specific submission record, assumed achievable within that duration for this example.

Forward calculation takes the latest predecessor finish at each merge. A, B and C reach time 7; D and E reach time 5. F therefore starts at max(7, 5) = 7. G finishes at 9 and H at 11. The eight durations add to 16 working days of activity duration, but they do not form one sequence. Nor are those 16 days necessarily person-days: an external wait can occupy schedule time without equivalent labour.

For the table’s backward pass, fix the end at the unconstrained earliest finish of 11, not at the buyer deadline. Subtract each duration from its latest finish, and set a predecessor’s latest finish to the earliest latest start among its successors. The evidence branch has zero total float against that endpoint. D and E each show two days, shared along their branch. Delaying D by two days leaves E no remaining branch allowance. The two cells do not provide four days.

Brackenmere: working-day offsets; late times anchored to forecast finish 11
ActivityPredecessorDurationEarly start / finishLate start / finishTotal float
A EvidenceStart40 / 40 / 40
B ValidationA14 / 54 / 50
C Technical answerB25 / 75 / 70
D Partner inputStart30 / 32 / 52
E Cost checkD23 / 55 / 72
F ReconciliationC and E17 / 87 / 80
G Release-ready packageF18 / 98 / 90
H Delivery and confirmationG29 / 119 / 110

A zero-float path can still finish before the deadline

Assume Brackenmere’s controlling buyer deadline is time 12 and the internal release-ready target is time 10. The two-day H activity is already in the network. Forecast release readiness at 9 is one day ahead of the internal target; forecast confirmed submission at 11 is one day ahead of the buyer deadline. Those are two views of the same one-day end allowance, not two independent reserves. The two-day delivery activity is planned work and waiting, not unused float.

A second backward pass anchored to required finish 12 would move the latest times one day later in this simple model. That gives the driving chain one day of deadline-relative allowance and the other branch three. It does not change the earliest finish of 11 or remove the evidence branch as its driver. Label which endpoint produced each float value; mixing the table’s unconstrained values with the deadline-relative values creates an apparently contradictory report.

Free float asks a different question: how much can this activity slip without moving its immediate successor’s earliest start? D has zero free float because E starts at 3 as soon as D finishes. E has two because F cannot start until C finishes at 7. D can use shared total float only by moving E. That matters when E’s reviewer has a booked slot: the logical allowance may not be available in the resource calendar.

Use latest safe dates as conditional limits, not invitations to wait. Record the endpoint, calendar, duration basis and required residual reserve behind each date. If an external input is due at its mathematical limit and its owner has not confirmed delivery, the plan is exposed even while the arithmetic balances. Negative deadline margin reports a recovery requirement; a date constraint cannot perform the missing work.

Check whether the calculated starts can occur

The Brackenmere table deliberately assumes resource independence. In a live bid, match each scheduled interval to the person’s confirmed allocation and the decision authority required. Two reviews of two days each cannot overlap merely because they belong to different work packages. If the same qualified reviewer must perform both, test an authorized sequence or a qualified substitute and recalculate the downstream finish.

NASA’s Schedule Management Handbook, revision 2 effective 15 March 2024, addresses resource loading and the need to review the consequences of leveling. It also calls for current remaining durations and a common status date. These are NASA scheduling practices; their use here is to expose an unsupported reviewer overlap and prevent stale progress from controlling the forecast.

A committee slot has an input cutoff as well as a meeting time. Missing the cutoff by fifteen minutes can move a decision to the next session even when its active review takes only an hour. Model the admissible slot, preparation requirement and possible outcome. A reserved meeting proves availability, not approval. An adverse or deferred decision needs its own remaining-work scenario and may block release entirely.

Calendar exchange needs equal care. RFC 5545 distinguishes floating local times from UTC and local times tied to a time zone. A floating appointment can refer to different instants for different recipients. Preserve a fixed event’s time-zone meaning when exporting the plan. The calendar format does not determine the buyer’s deadline or grant access to an approval session.

Measure the gain at the finish, not just at the task

In a scenario copy, reduce A from four to two days while preserving its evidence and acceptance conditions. The technical branch now finishes at 5, exactly when the commercial branch finishes. F, G and H add four days, so submission moves from 11 to 9. Both branches now drive the finish. Reducing A again to one day produces no further gain: the commercial branch still arrives at 5. The first intervention saves two days at the finish; the second saves only local task time.

Conversely, reducing D from three days to one in the original plan leaves submission at 11. The evidence branch still reaches the merge at 7. If D instead stretches to six days, its branch reaches 8, the full finish becomes 12, and the one-day deadline margin disappears. At seven days for D, the finish becomes 13, one day beyond the assumed deadline. These comparisons change only D or A as stated; they do not assume an unmentioned faster review.

Before presenting a saving as available, explain how the change can occur. Earlier access to already validated evidence may shorten A; extra writers may not. Parallel review may shorten a queue only if the reviewers hold the required authority and receive usable inputs. Removing a mandatory check is a different, potentially impermissible scope change, not a scheduling improvement. Include added cost, rework exposure and displaced commitments for the actual decision maker.

Test plausible delays on near-driving branches as well as gains on the current driver. Keep correlated assumptions together: if one missing service decision affects both the technical answer and the cost check, do not model its effects as unrelated favourable events. A deterministic network and a few scenarios do not establish a probability of on-time delivery. Use a justified risk model and competent review before attaching a confidence percentage.

Independent Brackenmere scenarios; all unmentioned assumptions unchanged
ScenarioTechnical / commercial branch finishConfirmed-submission forecastMargin to buyer time 12
Original A = 4, D = 37 / 5111 day
A = 25 / 593 days
A = 14 / 593 days
D = 1, original A7 / 3111 day
D = 6, original A7 / 8120 days
D = 7, original A7 / 9131 day late

Return the network, its limits and the next authorized decision

An agent’s useful output includes the input snapshot, activity and edge tables, calendar references, duration evidence, completed-work records, resource assumptions, calculation method and selected finish. For each activity, preserve early and late times, the endpoint used for float, controlling predecessor, source quality and unresolved conditions. Include the current driving chains and any tested branch that can take over. Retain a readable explanation beside the machine-readable fields.

Report one of: forecast supported under stated assumptions, conditional on named inputs, infeasible against the stated deadline, network invalid, or authority missing for the proposed intervention. Multiple blockers can coexist. A network with a cycle is not merely late; it needs repair. A network with an unknown mandatory external event has no supported whole-bid finish, even if the internal portion is fully calculated.

W3C PROV-DM provides separate concepts for plans, activities and revised entities. They support keeping a schedule version distinct from execution evidence and linking a revised forecast to its predecessor. The model does not prove that a scheduled review happened. That distinction matters when an automated report consumes a plan as if it were a completion log.

Within granted access, an agent may inspect supplied schedules, check links, calculate timing, compare scenarios and draft an internal recommendation. It must not book people, contact a buyer or partner, obtain private evidence, change live commitments, spend money, waive checks, approve an offer or submit it without separate authority. A proposed earlier date is not a message the agent is entitled to send on someone else’s behalf.

After each material status change, preserve the old forecast, update remaining durations from current evidence and recalculate affected successors and resource conflicts. Name the changed driver and the resulting decision deadline. If the schedule is infeasible, route the record to the existing recovery or pursuit authority. The completed work product is an inspectable scheduling decision, with its open conditions intact.

Useful outcomes from find the critical path in an RFP response

  • Every required unfinished activity reaches an identified terminal milestone.
  • The forecast finish is calculated separately from the required finish.
  • Branch float, protected delivery time and deadline margin are not counted twice.
  • Reviewer and external-input availability can invalidate an otherwise correct calculation.
  • An intervention has a reproducible finish-date effect and an approval boundary.
  • Updated evidence can change the driving path without erasing the previous forecast.

How to run the work

  1. 01

    Freeze the scheduling snapshot

    Identify the bid, lot, response version, status instant, required finish and internal handoff. Import accepted work scope, owners and completion evidence.

  2. 02

    Connect the remaining work

    Record predecessors, successor release conditions, durations, external waits and calendars. Reject missing links and unexplained circular dependencies.

  3. 03

    Calculate early and late timing

    Run forward and backward passes under explicit assumptions. Trace the finish-driving chain and calculate branch flexibility against a named endpoint.

  4. 04

    Check resource and calendar feasibility

    Verify that the people, decision slots and permitted external routes exist when required. Recalculate after resolving conflicts.

  5. 05

    Compare interventions

    Change one evidenced assumption in a scenario copy, recalculate all affected branches and preserve required checks. Separate potential gain from authorized action.

  6. 06

    Issue and refresh the decision record

    Report the forecast, margin, blockers, source quality and next decision. Update remaining durations and dependencies when evidence changes.

Questions that change the decision

  • What exactly must be complete at the terminal milestone?
  • Which predecessor controls each merge?
  • Is the constraint a work duration, an availability window or an unconfirmed external event?
  • Which near-driving branch would take over after an intervention?
  • Can the claimed time saving occur with the available people and unchanged controls?
  • What evidence would invalidate today’s latest safe start?

Where teams lose control

01

A manually imposed finish date hides infeasibility.

02

The same branch float is promised to several contributors.

03

A review meeting is scheduled before its admissible input cutoff.

04

Completed-looking drafts omit validation or release work.

05

Unconfirmed partner delivery is entered as a guaranteed date.

06

A faster forecast is treated as permission to spend, contact, approve or submit.

Measure the finished job

Measure the completed workflow, including review effort and exceptions. Output volume on its own is not evidence of a better process.

  • Unfinished required activities without a path to completion
  • Driving inputs with unconfirmed duration or availability
  • Remaining margin at the protected handoff and external finish
  • Shared-resource overlaps in the proposed schedule
  • Changes in the driving path since the previous status cut
  • Interventions with verified finish gains versus local task gains

Common questions

Is the longest answer always on the critical path?

No. Its duration matters only through its dependencies and available timing allowance. A short approval or an external input can determine the finish while a long answer has room to move. Calculate the complete remaining path to the selected milestone.

Can a critical path have positive float?

Yes, depending on the endpoint and constraints used in the calculation. A finish-driving chain can complete before a required deadline. Identify the driving chain and state whether float is measured against the earliest finish or a constrained target; a software colour alone is insufficient.

Can each contributor use the float shown beside their task?

Not independently. Activities on a branch can share the same total float. One delay can consume the allowance available to successors. Resource reservations and other constraints may further reduce what is usable.

What if a partner has not confirmed a delivery date?

Keep that dependency unconfirmed. Calculate named conditional scenarios if useful, but do not represent the requested date as evidence. If the mandatory external input has no bounded timing basis, the whole-bid forecast remains unsupported.

Does a feasible network authorize submission?

No. It shows conditional timing feasibility. Evidence acceptance, commitments, disclosure, release approval, portal authority and the procedure-specific submission record remain separate controls.

Primary references

Tony Kim

Tony Kim

Founder and CEO

Tony writes about applied AI, dependable product engineering and the systems that turn complex response work into controlled delivery.

Proposal software for source-grounded RFP, RFI, DDQ and questionnaire response work.

Bid, proposal, presales, security and compliance teams. Start with the workflow, constraints and evidence you already have.