Struct GreedySchedulerSuggestor 

pub struct GreedySchedulerSuggestor;

Schedules tasks via Earliest-Deadline-First + earliest-available skilled agent.

Algorithm: O(n·m·log n) where n = tasks, m = agents.

When to use: latency-sensitive pipelines where a good schedule is needed in microseconds. Use alongside CpSatSchedulerSuggestor in a Formation; the Engine will emit both plans and the highest-confidence one (CP-SAT optimal) will be accepted for execution.

Confidence: capped at 0.65 — greedy cannot prove optimality.

Trait Implementations

impl Suggestor for GreedySchedulerSuggestor

fn name(&self) -> &str

Human-readable name, used for logging and provenance.

fn dependencies(&self) -> &[ContextKey]

Context keys this suggestor reads from.

fn complexity_hint(&self) -> Option<&'static str>

Algorithmic complexity of this suggestor’s core computation.

fn accepts(&self, ctx: &dyn Context) -> bool

Pure predicate: should this suggestor execute given the current context?

fn execute<'life0, 'life1, 'async_trait>( &'life0 self, ctx: &'life1 dyn Context, ) -> Pin<Box<dyn Future<Output = AgentEffect> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Produce effects given the current context.