{"uid":"cap_hcyTcZayUIJ1JYiLO_tfp","slug":"assembly-critical-path-analyzer-cdfff2c4","name":"Assembly Critical Path Analyzer","description":"Compute earliest/latest starts and finishes and slack on a declared DAG of at most 48 tasks. Rejects cycles and unknown dependencies. Reports peak overlap of declared unit resource claims at the earliest schedule; does not optimize a resource-constrained schedule or verify physical resources.","url":"https://www.mahastrategies.com/api/v1/micro/assembly-critical-path?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","$schema":"https://json-schema.org/draft/2020-12/schema","required":["input"],"properties":{"input":{"type":"object","required":["type","method","bodyType","body"],"properties":{"body":{"type":"object","required":["dataClass","tasks","resources"],"properties":{"tasks":{"type":"array","maxItems":48,"minItems":1},"dataClass":{"enum":["public","synthetic"],"type":"string"},"resources":{"type":"array","maxItems":16,"minItems":0}},"additionalProperties":false},"type":{"type":"string","const":"http"},"method":{"enum":["POST"],"type":"string"},"bodyType":{"enum":["json","form-data","text"],"type":"string"}},"additionalProperties":false},"output":{"type":"object","required":["type"],"properties":{"type":{"type":"string"},"example":{"type":"object","required":["version","offerId","amountBaseUnits","inputDigest","result","boundaries","receiptDigest"],"properties":{"result":{"type":"object"},"offerId":{"enum":["assembly-critical-path"],"type":"string"},"version":{"enum":["maha-microproducts/0.1"],"type":"string"},"boundaries":{"type":"array","maxItems":128,"minItems":0},"inputDigest":{"type":"string","maxLength":71},"receiptDigest":{"type":"string","maxLength":71},"amountBaseUnits":{"enum":["57000"],"type":"string"}},"additionalProperties":false}}}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.057","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"registry","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.057/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.057","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.057","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_2ypu3AR-SOvgm3fRUNy3r","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.057","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes earliest/latest start and finish times, float/slack, and peak resource overlap for a DAG of up to 48 tasks using critical path method (CPM).","exampleAgentPrompt":"I have 12 assembly tasks with dependencies and unit resource claims — can you run a critical path analysis to find the earliest and latest start/finish times, slack for each task, and peak resource overlap at the earliest schedule? Here's the task list and dependency DAG, with dataClass set to 'synthetic'.","exampleUseCases":[{"title":"Manufacturing assembly line scheduling","prompt":"I have a list of 20 manufacturing tasks with durations and dependencies — can you compute the critical path, showing earliest and latest start/finish times and how much float each task has? The data is synthetic. I also want to know the peak overlap of resource claims at the earliest schedule."},{"title":"Software release dependency planning","prompt":"Here are 15 software deployment tasks with their dependencies declared as a DAG — run CPM on them, classify the data as public, and tell me which tasks are on the critical path, what the slack is for each, and when the earliest possible finish is."},{"title":"Construction project task float analysis","prompt":"I've got 35 construction subtasks with declared dependencies and unit resource usage. Can you compute the earliest/latest starts and finishes and slack values for each task, and flag if there are any cycles in the dependency graph? Use synthetic as the data class."}],"resultDescription":"Returns a versioned result object including earliest and latest start/finish times and slack for each task, identification of critical path tasks (zero slack), an array of schedule boundary declarations (up to 128 entries), peak resource overlap at the earliest schedule, plus an inputDigest and receiptDigest for integrity verification.","failureModes":["Cycle detected in task dependency graph — request rejected with error","Unknown dependency referenced in task list — request rejected","Task count exceeds 48-item limit — rejected with validation error","Resource array exceeds 16-item limit — rejected","Invalid dataClass enum value — schema validation error","Malformed DAG input — missing required fields returns 400-level error"],"whenToPreferThis":"Choose this endpoint when you need classic Critical Path Method (CPM) analysis — earliest/latest start and finish times with float/slack — on a declared task DAG of up to 48 tasks. It is purpose-built for project and assembly scheduling, includes cycle detection, and reports peak resource overlap at the earliest schedule. It does not optimize resource-constrained schedules or verify physical resources, so prefer it for analytical CPM calculations rather than full resource leveling or optimization problems.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-16T06:52:50.513Z","isFirstParty":false,"canonicalSlug":"assembly-critical-path-analyzer-cdfff2c4"}