Critical Path Method (CPM) DAG & Resource Constraint Scheduler
schedule_critical_path_tasksSolves a task dependency DAG via the Critical Path Method (CPM) to compute ES/EF/LS/LF, Total Float/Slack, optimal makespan, and the Critical Path. Use when scheduling dependent engineering milestones or workflow steps to find the minimum project duration and zero-slack bottleneck path; for detecting circular code imports and file blast radius without task durations, use audit_module_dependency_cycles instead. Read-only edge call (32 KB, 60 RPM): accepts 'tasks_json' ('time_unit' defaults to 'minutes'), supports '?demo=true' or L402 (80 sats), and returns HTTP 400 if invalid.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| time_unit | No | Duration unit label attached to the schedule; defaults to 'hours' when omitted. | |
| tasks_json | Yes | JSON string or array of tasks '[{"id":"t1","duration":3,"dependencies":[]}]' to schedule. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| total_tasks | Yes | Number of DAG tasks scheduled. | |
| critical_path | Yes | Ordered task IDs with zero slack that determine the overall project duration. | |
| task_schedule | Yes | Per-task earliest_start, earliest_finish, latest_start, latest_finish, and total_float_slack. | |
| optimal_makespan_duration | Yes | Minimum total duration required to complete all tasks. |