Struct MatchAllocationSolver 

pub struct MatchAllocationSolver;

Match-based allocation solver for capacity planning

Algorithm:

1. Sort demands by priority (highest first)
2. For each demand, find teams with matching skills and resource types
3. Allocate capacity from matching teams, respecting utilization limits
4. Track fulfillment and utilization metrics

Implementations

impl MatchAllocationSolver

pub fn solve_capacity( &self, input: &CapacityPlanningInput, spec: &ProblemSpec, ) -> Result<(CapacityPlanningOutput, SolverReport)>

Solve the capacity planning problem

Trait Implementations

impl PackSolver for MatchAllocationSolver

fn id(&self) -> &'static str

Solver identifier (e.g., “greedy-v1”)

fn solve(&self, spec: &ProblemSpec) -> Result<(Value, SolverReport)>

Solve and produce plan payload + report

fn is_exact(&self) -> bool

Whether this solver guarantees optimality