Multiprocessor scheduling policy with deadline constraint for determining multi …

This is a computer program designed to create a schedule for multiple independent workers or systems (agents) that need to complete a set of tasks. Each task is broken down into smaller steps, and each step requires a specific resource. The program figures out if a particular step can be done at a specific time, taking into account rules like when tasks must be finished, the order they need to be done, and if one task has to wait for another.

Why it matters: Since 2013, the widespread adoption of cloud-native architectures, AI model training, and multi-robot systems has dramatically increased the need for and the computational feasibility of sophisticated, deadline-aware multi-agent scheduling.

Status: Not in forceListed as no longer active. The specific reason is not in the record we hold.
How hard to build: SpecializedSoftware logic, complex algorithm

3 AI reinvention directions for this patent

See all three

AI gives you a few directions you could take this. Pick one, and we check whether your version is different enough to patent, then write the filing.

Reinvent this with AI

Where this one came from

Every morning we go through millions of abandoned patents and pick out 15 worth your time. This was one of today’s.

This one

+10