CP Crash
Find the cheapest way to pull the finish date in, see what each day actually costs, and know the exact date the critical path moves to a different chain.
Who it is for. Anyone who has been asked to get six weeks back and has to say what it costs and where it breaks — otherwise a night of manual duration edits.
What it is for
Every capital project eventually needs acceleration, and the standard method is to shorten whatever looks longest and re-run. That is almost never the cheapest cut, and it hides the moment a secondary path becomes critical and further compression buys nothing.
An exact minimum cut over the critical subnetwork respects all four relationship types. The resulting time-cost curve shows the cost of each day recovered, the least-cost point and when another path becomes critical.
What it does
Every line below is in the product today.
Every day bought by an exact minimum cut
Every day of compression comes from solving for the actual cheapest cut across the whole critical sub-network, not the shorten-the-longest-activity heuristic most people do by hand.
The cut respects relationship types
Finish-to-start ties predecessor finish to successor start, start-to-start ties starts, and so on — so an activity sandwiched by start-to-start links is never wrongly selected.
Float paths ranked, with changeover dates
Leaf activities banded by total float into ranked paths, each with the date it becomes critical, counted in working days.
The full time-cost trade-off curve
Direct cost added, indirect burn avoided, net, the marginal cost of the last day bought, and which activities were cut.
The least-cost point, found for you
The minimum net delta on the curve, reachable from the ribbon and from the chart itself.
Crash rates with visible provenance
Explicit cost per day, or derived from activity cost over duration, or assumed from the median — and the row tells you which.
Monte Carlo over the compression plan
PERT sampling across min and max durations with P10 to P90 finish markers overlaid on the crash Gantt.
Checked against the hard cases
Ranking, changeover dates and the compression plan are checked against the messy cases — parallel float paths and activities tied together by start-to-start links — so the ranking and the savings figure hold up on real schedules, not just clean ones.
It reads and writes with
Activities
The critical-path Gantt where the schedule is actually built — a virtualised table and timeline that computes your dates from logic, calendars and constraints instead of letting you type them.
Monte Carlo
Re-run the critical path again and again over three-point durations and register risks, then commit a chosen confidence level back into the schedule as a real, rescheduled plan.
Delay Digger
Forensic delay analysis on your own schedule revisions — window by window, separating what slipped because of progress from what slipped because someone edited the plan.
See it on your own schedule.
Send an XER before the call and we will import it and show you CP Crash running against your data.