{
  "artifact_hash": "11719c423aaaef96089463fc216077a444284875ddef5c24eed4321b0a0e70fb",
  "artifact_type": "dispatchatlas.solver_applicability",
  "cells": [
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "accelerator-coscheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "aerial-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "The restricted-neighbourhood matheuristic runs the classical-RCPSP envelope and schedules single-mode whole tasks; this family carries a moldable, gang co-start, or partial-execution task the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "anytime-inference",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 160; family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 160; family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "blocking-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: blocking.",
      "scheduling_family": "flow-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "bulk-synchronous-graph",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "declares none of the family's objectives (carbon, cost, energy, latency); optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "carbon-aware",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cloud-independent",
      "rationale": "deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "coflow-scheduling",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "compact-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "confidential-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "cyber-physical",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "data-locality",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "datacenter-colocation",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "digital-twin-sync",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "disaggregated-memory",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 160.",
      "scheduling_family": "flow-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 160.",
      "scheduling_family": "flow-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-assembly-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 120.",
      "scheduling_family": "job-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 120.",
      "scheduling_family": "job-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 192.",
      "scheduling_family": "flow-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 192.",
      "scheduling_family": "flow-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-permutation-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "The restricted-neighbourhood matheuristic runs the classical-RCPSP envelope and schedules single-mode whole tasks; this family carries a moldable, gang co-start, or partial-execution task the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-training-gang",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "distributed-transaction",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence": {
        "kind": "campaign",
        "pointer": "scalability-series"
      },
      "family_id": "edge-offloading",
      "rationale": "Exercised only along the runtime-scalability axis by the committed scalability ladder on the edge-offloading continuum family; the family's multi-objective trade-off and its communication and affinity constraints are not exercised by this trace and remain unverified.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "verified"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "evidence": {
        "kind": "campaign",
        "pointer": "scalability-series"
      },
      "family_id": "edge-offloading",
      "rationale": "Exercised only along the runtime-scalability axis by the committed scalability ladder on the edge-offloading continuum family; the family's multi-objective trade-off and its communication and affinity constraints are not exercised by this trace and remain unverified.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "verified"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "edge-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "The restricted-neighbourhood matheuristic runs the classical-RCPSP envelope and schedules single-mode whole tasks; this family carries a moldable, gang co-start, or partial-execution task the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "elastic-serverless-autoscale",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "native exact search caps at 12 tasks; family instances carry 24.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "native exact search caps at 8 tasks; family instances carry 24.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "The restricted-neighbourhood matheuristic runs the classical-RCPSP envelope and schedules single-mode whole tasks; this family carries a moldable, gang co-start, or partial-execution task the immediate-selection guard rejects at runtime.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "facility-assignment",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "failure-recovery",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, resilience; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "federated-learning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 128.",
      "scheduling_family": "job-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "evidence": {
        "kind": "campaign",
        "pointer": "runtime-quality-preview"
      },
      "family_id": "flexible-job-shop",
      "rationale": "Exercised end-to-end by the committed runtime-quality smoke campaign published as the runtime-quality-series.json portal bundle; the campaign materializes its flexible-job-shop smoke instance in-process rather than drawing it from the published benchmark catalog.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-start",
      "status": "verified"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 128.",
      "scheduling_family": "job-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence": {
        "kind": "campaign",
        "pointer": "convergence-preview"
      },
      "family_id": "flexible-job-shop",
      "rationale": "Exercised end-to-end by the committed convergence smoke campaign published as the convergence-series.json portal bundle; the campaign materializes its flexible-job-shop smoke instance in-process rather than drawing it from the published benchmark catalog.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-core",
      "status": "verified"
    },
    {
      "evidence": {
        "kind": "campaign",
        "pointer": "convergence-preview"
      },
      "family_id": "flexible-job-shop",
      "rationale": "Exercised end-to-end by the committed convergence smoke campaign published as the convergence-series.json portal bundle; the campaign materializes its flexible-job-shop smoke instance in-process rather than drawing it from the published benchmark catalog.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-fast",
      "status": "verified"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "evidence": {
        "kind": "campaign",
        "pointer": "runtime-quality-preview"
      },
      "family_id": "flexible-job-shop",
      "rationale": "Exercised end-to-end by the committed runtime-quality smoke campaign published as the runtime-quality-series.json portal bundle; the campaign materializes its flexible-job-shop smoke instance in-process rather than drawing it from the published benchmark catalog.",
      "scheduling_family": "job-shop",
      "solver_id": "shortest-processing-time",
      "status": "verified"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flexible-job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 160.",
      "scheduling_family": "flow-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 160.",
      "scheduling_family": "flow-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "fpga-partitioning",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "native exact search caps at 12 tasks; family instances carry 128.",
      "scheduling_family": "job-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "native exact search caps at 8 tasks; family instances carry 128.",
      "scheduling_family": "job-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "frontierco-fjsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "generative-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "gpu-ml",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 160.",
      "scheduling_family": "flow-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 160.",
      "scheduling_family": "flow-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "hybrid-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "immersive-xr",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "intermittent-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "iot-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 128.",
      "scheduling_family": "job-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "evidence": {
        "kind": "campaign",
        "pointer": "stability-robustness-preview"
      },
      "family_id": "job-shop",
      "rationale": "Exercised across seed replicates by the committed stability-robustness smoke campaign on the job-shop smoke instance.",
      "scheduling_family": "job-shop",
      "solver_id": "differential-evolution",
      "status": "verified"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 128.",
      "scheduling_family": "job-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence": {
        "kind": "campaign",
        "pointer": "stability-robustness-preview"
      },
      "family_id": "job-shop",
      "rationale": "Exercised across seed replicates by the committed stability-robustness smoke campaign on the job-shop smoke instance.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-core",
      "status": "verified"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "evidence": {
        "kind": "campaign",
        "pointer": "stability-robustness-preview"
      },
      "family_id": "job-shop",
      "rationale": "Exercised across seed replicates by the committed stability-robustness smoke campaign on the job-shop smoke instance.",
      "scheduling_family": "job-shop",
      "solver_id": "particle-swarm",
      "status": "verified"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "evidence": {
        "kind": "campaign",
        "pointer": "stability-robustness-preview"
      },
      "family_id": "job-shop",
      "rationale": "Exercised across seed replicates by the committed stability-robustness smoke campaign on the job-shop smoke instance.",
      "scheduling_family": "job-shop",
      "solver_id": "simulated-annealing",
      "status": "verified"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "job-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "The restricted-neighbourhood matheuristic runs the classical-RCPSP envelope and schedules single-mode whole tasks; this family carries a moldable, gang co-start, or partial-execution task the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "kv-cache-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "native exact search caps at 12 tasks; family instances carry 64.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "native exact search caps at 8 tasks; family instances carry 64.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "machine-scheduling",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "native exact search caps at 12 tasks; family instances carry 768; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "native exact search caps at 8 tasks; family instances carry 768; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "microservice-dag",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "mixed-criticality",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "moe-expert-parallel",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family.",
      "scheduling_family": "flow-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "native exact search caps at 12 tasks; family instances carry 200; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "native exact search caps at 8 tasks; family instances carry 200; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "The restricted-neighbourhood matheuristic optimizes pure makespan; this family carries a deadline or lateness objective the immediate-selection guard rejects at runtime.",
      "scheduling_family": "flow-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "flow-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-objective-pfsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "flow-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "rcpsp",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family.",
      "scheduling_family": "rcpsp",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "rcpsp",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "rcpsp",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "rcpsp",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "native exact search caps at 12 tasks; family instances carry 180; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "rcpsp",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "native exact search caps at 8 tasks; family instances carry 180; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "rcpsp",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "The restricted-neighbourhood matheuristic optimizes pure makespan; this family carries a deadline or lateness objective the immediate-selection guard rejects at runtime.",
      "scheduling_family": "rcpsp",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-project-rcpsp",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared.",
      "scheduling_family": "rcpsp",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "The restricted-neighbourhood matheuristic runs the classical-RCPSP envelope and schedules single-mode whole tasks; this family carries a moldable, gang co-start, or partial-execution task the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "multi-tenant-fair-share",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "network-slicing",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: anti-affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 160; family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 160; family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "flow-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "no-wait-flow-shop",
      "rationale": "family declares constraint features with no capability-tag counterpart: no-wait.",
      "scheduling_family": "flow-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 400.",
      "scheduling_family": "open-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 400.",
      "scheduling_family": "open-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "open-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "open-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "orbital-edge",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "pipeline-parallel-training",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "native exact search caps at 12 tasks; family instances carry 768.",
      "scheduling_family": "rcpsp",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "native exact search caps at 8 tasks; family instances carry 768.",
      "scheduling_family": "rcpsp",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "native exact search caps at 12 tasks; family instances carry 128; family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "native exact search caps at 8 tasks; family instances carry 128; family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-max",
      "rationale": "family declares constraint features with no capability-tag counterpart: time-window.",
      "scheduling_family": "rcpsp-max",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "native exact search caps at 12 tasks; family instances carry 768.",
      "scheduling_family": "rcpsp",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "native exact search caps at 8 tasks; family instances carry 768.",
      "scheduling_family": "rcpsp",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "The restricted-neighbourhood matheuristic runs the classical-RCPSP envelope and schedules single-mode whole tasks; this family carries a moldable, gang co-start, or partial-execution task the immediate-selection guard rejects at runtime.",
      "scheduling_family": "rcpsp",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "rcpsp-multi-mode",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "rcpsp",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "native exact search caps at 12 tasks; family instances carry 200.",
      "scheduling_family": "job-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "native exact search caps at 8 tasks; family instances carry 200.",
      "scheduling_family": "job-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "reentrant-fab",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "job-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "replica-placement",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: data-locality.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "serverless-cold-start",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: setup; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "service-function-chain",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "searches a continuous space decoded via the spv-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "searches a continuous space decoded via the rounding-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "native exact search caps at 12 tasks; family instances carry 24.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "native exact search caps at 8 tasks; family instances carry 24.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "searches a continuous space decoded via the random-key-adapter with topological repair; capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "setup-flow-shop",
      "rationale": "capability-aligned on declared objectives and constraints; no campaign evidence recorded.",
      "scheduling_family": "setup-flow-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "smartnic-offload",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "split-inference-serving",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "spot-preemptible",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: affinity; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "The restricted-neighbourhood matheuristic runs the classical-RCPSP envelope and schedules single-mode whole tasks; this family carries a moldable, gang co-start, or partial-execution task the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "storage-io-tiering",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication, release-time; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "streaming-window",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "time-sensitive-networking",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "native exact search caps at 12 tasks; family instances carry 20; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "native exact search caps at 8 tasks; family instances carry 20; family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "unrelated-parallel-setup",
      "rationale": "family declares constraint features with no capability-tag counterpart: setup.",
      "scheduling_family": "machine-scheduling",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vehicular-offloading",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "video-analytics",
      "rationale": "optimizes one objective axis of a multi-objective family; deadline pressure handled as soft lateness; no deadline-aware capability declared; family declares constraint features with no capability-tag counterpart: communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "native exact search caps at 12 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "native exact search caps at 8 tasks; family instances carry 96; optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "dominance-based ranking loses selection pressure on this many-objective family; a many-objective method is preferable; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling; no repair or dispatching mechanism for the family's declared uncertainty.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "vm-allocation",
      "rationale": "optimizes one objective axis of a multi-objective family; family declares constraint features with no capability-tag counterpart: anti-affinity, communication; produces a static schedule for a family with dynamic arrivals/rescheduling.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the spv-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the rounding-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "native exact search caps at 12 tasks; family instances carry 768; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "native exact search caps at 8 tasks; family instances carry 768; family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication; searches a continuous space decoded via the random-key-adapter with topological repair.",
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "The restricted-neighbourhood matheuristic represents finish-start precedence with no time lag; this family carries a non-zero precedence lag the immediate-selection guard rejects at runtime.",
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "family_id": "workflow-dag",
      "rationale": "family declares constraint features with no capability-tag counterpart: communication.",
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    }
  ],
  "constraint_bridge": [
    {
      "capability": "deadline-aware",
      "constraint": "deadline"
    },
    {
      "capability": "precedence-aware",
      "constraint": "precedence"
    },
    {
      "capability": "capacity-aware",
      "constraint": "capacity"
    }
  ],
  "evidence_class": "metadata-only",
  "families": [
    "accelerator-coscheduling",
    "aerial-edge",
    "anytime-inference",
    "blocking-flow-shop",
    "bulk-synchronous-graph",
    "carbon-aware",
    "cloud-independent",
    "coflow-scheduling",
    "compact-job-shop",
    "confidential-edge",
    "cyber-physical",
    "data-locality",
    "datacenter-colocation",
    "digital-twin-sync",
    "disaggregated-memory",
    "distributed-assembly-flow-shop",
    "distributed-flexible-job-shop",
    "distributed-permutation-flow-shop",
    "distributed-training-gang",
    "distributed-transaction",
    "edge-offloading",
    "edge-placement",
    "elastic-serverless-autoscale",
    "facility-assignment",
    "failure-recovery",
    "federated-learning",
    "flexible-job-shop",
    "flow-shop",
    "fpga-partitioning",
    "frontierco-fjsp",
    "generative-inference-serving",
    "gpu-ml",
    "hybrid-flow-shop",
    "immersive-xr",
    "intermittent-edge",
    "iot-edge",
    "job-shop",
    "kv-cache-placement",
    "machine-scheduling",
    "microservice-dag",
    "mixed-criticality",
    "moe-expert-parallel",
    "multi-objective-pfsp",
    "multi-project-rcpsp",
    "multi-tenant-fair-share",
    "network-slicing",
    "no-wait-flow-shop",
    "open-shop",
    "orbital-edge",
    "pipeline-parallel-training",
    "rcpsp",
    "rcpsp-max",
    "rcpsp-multi-mode",
    "reentrant-fab",
    "replica-placement",
    "serverless-cold-start",
    "service-function-chain",
    "setup-flow-shop",
    "smartnic-offload",
    "split-inference-serving",
    "spot-preemptible",
    "storage-io-tiering",
    "streaming-window",
    "time-sensitive-networking",
    "unrelated-parallel-setup",
    "vehicular-offloading",
    "video-analytics",
    "vm-allocation",
    "workflow-dag"
  ],
  "family_count": 69,
  "policy": "Cell status is declared applicability, never a performance claim. Verified cells cite a named public campaign artifact, citation source, or test; approximate cells are derived from declared solver capabilities and benchmark-family traits and are labeled as such.",
  "producer": "dispatchatlas.lab",
  "scheduling_family_rollup": [
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "machine-scheduling",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "approximate"
    },
    {
      "evidence_pointers": [
        "stability-robustness-preview"
      ],
      "scheduling_family": "job-shop",
      "solver_id": "differential-evolution",
      "status": "verified"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [
        "runtime-quality-preview"
      ],
      "scheduling_family": "job-shop",
      "solver_id": "earliest-start",
      "status": "verified"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [
        "convergence-preview",
        "stability-robustness-preview"
      ],
      "scheduling_family": "job-shop",
      "solver_id": "ndso-core",
      "status": "verified"
    },
    {
      "evidence_pointers": [
        "convergence-preview"
      ],
      "scheduling_family": "job-shop",
      "solver_id": "ndso-fast",
      "status": "verified"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "evidence_pointers": [
        "stability-robustness-preview"
      ],
      "scheduling_family": "job-shop",
      "solver_id": "particle-swarm",
      "status": "verified"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "evidence_pointers": [
        "runtime-quality-preview"
      ],
      "scheduling_family": "job-shop",
      "solver_id": "shortest-processing-time",
      "status": "verified"
    },
    {
      "evidence_pointers": [
        "stability-robustness-preview"
      ],
      "scheduling_family": "job-shop",
      "solver_id": "simulated-annealing",
      "status": "verified"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "job-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "open-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "flow-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "setup-flow-shop",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "ndso-core",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "shortest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "rcpsp-max",
      "solver_id": "whale-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "adpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "age-moea-ii",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "ant-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "apparent-tardiness-cost",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "arithmetic-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-bee-colony",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "artificial-fish-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "beam-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "branch-and-bound",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "ccgp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "cma-es",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "cpop",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "critical-path-tabu",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "cuckoo-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "d-clpso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "d-depso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "d-lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "dan-dual-attention",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "decima-dag-rl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "decision-diagram-sequencing",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "differential-evolution",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-deadline",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-finish-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "earliest-start",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "epso",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "exhaustive-enumeration",
      "status": "not-applicable"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "firefly-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "fjsp-hgnn-drl",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "genetic-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "grasshopper-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "gravitational-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "greedy-completion",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "grey-wolf-optimizer",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "guided-local-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "gurobi-exact",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "harris-hawks-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "heft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "ibea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "iterated-greedy-rs",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "jaya-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "l2d-disjunctive-gnn",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "l2s-improvement",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "learned-priority-policy",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "logic-based-benders-decomposition",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "longest-processing-time",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "lshade",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "marine-predators",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "matheuristic-restricted-neighbourhood",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "max-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "min-min",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "minimum-slack",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "moead",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "monte-carlo-tree-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "moth-flame-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [
        "scalability-series"
      ],
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-core",
      "status": "verified"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-fast",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "ndso-summit",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "neh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "nsga3",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "ortools-cp-sat",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "particle-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "peft",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "pulp-milp",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "residual-scheduling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "rl-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "rollout",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "rvea",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "salp-swarm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "sarsa-dispatching",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "scatter-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "selection-hyper-heuristic",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "serial-sgs-justification",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "shifting-bottleneck",
      "status": "approximate"
    },
    {
      "evidence_pointers": [
        "scalability-series"
      ],
      "scheduling_family": "distributed-computing",
      "solver_id": "shortest-processing-time",
      "status": "verified"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "simulated-annealing",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "sine-cosine-algorithm",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "slim-self-labeling",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "sms-emoa",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "spea2",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "squeaky-wheel",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "sufferage",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "surrogate-assisted-gp-hh",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "tabu-mrcpsp-mode-search",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "teaching-learning-optimization",
      "status": "approximate"
    },
    {
      "evidence_pointers": [],
      "scheduling_family": "distributed-computing",
      "solver_id": "whale-optimization",
      "status": "approximate"
    }
  ],
  "schema_version": "1.0",
  "solver_count": 87,
  "solvers": [
    "adpso",
    "age-moea-ii",
    "ant-colony",
    "apparent-tardiness-cost",
    "arithmetic-optimization",
    "artificial-bee-colony",
    "artificial-fish-swarm",
    "beam-search",
    "branch-and-bound",
    "ccgp",
    "clpso",
    "cma-es",
    "cpop",
    "critical-path-tabu",
    "cuckoo-search",
    "d-clpso",
    "d-depso",
    "d-lshade",
    "dan-dual-attention",
    "decima-dag-rl",
    "decision-diagram-sequencing",
    "differential-evolution",
    "earliest-deadline",
    "earliest-finish-time",
    "earliest-start",
    "epso",
    "exhaustive-enumeration",
    "firefly-algorithm",
    "fjsp-hgnn-drl",
    "genetic-algorithm",
    "grasshopper-optimization",
    "gravitational-search",
    "greedy-completion",
    "grey-wolf-optimizer",
    "guided-local-search",
    "gurobi-exact",
    "harris-hawks-optimization",
    "heft",
    "ibea",
    "iterated-greedy-rs",
    "jaya-algorithm",
    "l2d-disjunctive-gnn",
    "l2s-improvement",
    "learned-priority-policy",
    "logic-based-benders-decomposition",
    "longest-processing-time",
    "lshade",
    "marine-predators",
    "matheuristic-restricted-neighbourhood",
    "max-min",
    "min-min",
    "minimum-slack",
    "moead",
    "monte-carlo-tree-search",
    "moth-flame-optimization",
    "ndso-core",
    "ndso-fast",
    "ndso-summit",
    "neh",
    "nsga2",
    "nsga3",
    "ortools-cp-sat",
    "particle-swarm",
    "peft",
    "pulp-milp",
    "residual-scheduling",
    "rl-dispatching",
    "rollout",
    "rvea",
    "salp-swarm",
    "sarsa-dispatching",
    "scatter-search",
    "selection-hyper-heuristic",
    "serial-sgs-justification",
    "shifting-bottleneck",
    "shortest-processing-time",
    "simulated-annealing",
    "sine-cosine-algorithm",
    "slim-self-labeling",
    "sms-emoa",
    "spea2",
    "squeaky-wheel",
    "sufferage",
    "surrogate-assisted-gp-hh",
    "tabu-mrcpsp-mode-search",
    "teaching-learning-optimization",
    "whale-optimization"
  ],
  "status_counts": {
    "approximate": 5835,
    "not-applicable": 158,
    "verified": 10
  }
}