ferrox-solver 0.3.12

Iron-forged OR-Tools and HiGHS solvers as Converge Suggestors
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

//! Multi-agent task scheduling suggestors.
//!
//! Two competing implementations of the same scheduling contract:
//!
//! | Suggestor | Algorithm | Latency | Confidence |
//! |---|---|---|---|
//! | [`GreedySchedulerSuggestor`] | EDF + earliest-available | sub-ms | ≤ 0.65 |
//! | [`CpSatSchedulerSuggestor`] | CP-SAT optional-interval | seconds | ≤ 1.0 |
//!
//! # Formation pattern
//!
//! Register both in the same [`converge_core::Engine`].  Both accept
//! `"scheduling-request:*"` seeds and emit solver-prefixed plans to
//! `ContextKey::Strategies`:
//!
//! - Greedy → `"scheduling-plan-greedy:<id>"`
//! - CP-SAT → `"scheduling-plan-cpsat:<id>"`
//!
//! Downstream consumers compare confidence scores and select the plan that
//! maximises throughput.  In practice: greedy answers in < 1 ms; CP-SAT
//! improves on it and proves optimality within the time budget.
//!
//! # Benchmark result (60 tasks · 12 agents · 5 skills · horizon 360 min)
//!
//! ```text
//! Greedy:  56 / 60 tasks scheduled   (93.3 %)   0.03 ms
//! CP-SAT:  60 / 60 tasks scheduled  (100.0 %)   260 ms   ← optimal
//! ```
//!
//! CP-SAT scheduled 4 additional tasks that greedy could not fit, and proved
//! the schedule is globally optimal.

pub mod problem;

pub mod greedy;

#[cfg(feature = "ortools")]
pub mod cpsat;

pub use problem::{
    SchedulingAgent, SchedulingPlan, SchedulingRequest, SchedulingTask, TaskAssignment,
};
pub use greedy::GreedySchedulerSuggestor;

#[cfg(feature = "ortools")]
pub use cpsat::CpSatSchedulerSuggestor;