rio: extract 1 claim from FJSP scheduling review

- What: grand-strategy claim that hybrid flow-shop pipelines with few stages and homogeneous workers achieve near-optimal throughput with simple dispatching rules (within 5-10% of optimal), making metaheuristic optimization unnecessary
- Why: ScienceDirect FJSP review (2023) establishes this bound from OR literature; directly relevant to Teleo pipeline architecture (research → extract → eval is a hybrid flow-shop)
- Connections: links to [[designing coordination rules is categorically different from designing coordination outcomes]] and [[mechanism design enables incentive-compatible coordination]] in foundations/collective-intelligence
- Note: source was tagged internet-finance but contains no internet-finance claims; claim correctly placed in grand-strategy; domain mismatch flagged in archive

Pentagon-Agent: Rio <2EA8DBCB-A29B-43E8-B726-45E571A1F3C8>

core/grand-strategy/hybrid-flow-shop-pipelines-with-few-stages-and-homogeneous-workers-perform-within-5-10-percent-of-optimal-with-simple-priority-dispatching-rules.md

@@ -0,0 +1,32 @@
+---
+type: claim
+domain: grand-strategy
+description: "For 3-5 stage pipelines with parallel homogeneous workers per stage, FIFO and shortest-job-first dispatching achieve near-optimal throughput — genetic algorithms and simulated annealing are unnecessary overhead at this scale."
+confidence: likely
+source: "rio via ScienceDirect FJSP review (2023) — hybrid flow-shop scheduling literature"
+created: 2026-03-12
+depends_on: []
+---
+
+# Hybrid flow-shop pipelines with few stages and homogeneous workers per stage perform within 5-10% of optimal with simple priority dispatching rules
+
+Scheduling theory literature on the Flexible Job Shop Scheduling Problem establishes a key structural insight: pipeline complexity varies dramatically with topology. The classical Job Shop Scheduling Problem — where jobs can follow arbitrary machine sequences — is NP-complete for more than 2 machines. The Flexible JSSP generalizes this further by allowing each operation to run on any eligible machine, adding machine assignment as an additional decision variable.
+
+The hybrid flow-shop is a structurally simpler variant: all jobs follow the same stage sequence, but multiple machines operate in parallel within each stage and any machine within a stage can handle the job. This is the topology of most multi-agent processing pipelines (e.g., research → extract → evaluate with multiple workers per stage).
+
+A 2023 ScienceDirect review of FJSP literature establishes that for hybrid flow-shops with relatively few stages and homogeneous workers within each stage, simple priority dispatching rules — shortest-job-first, FIFO within priority classes — perform within 5-10% of the theoretical optimum. Metaheuristics (genetic algorithms, simulated annealing, tabu search) dominate for NP-hard general instances but are unnecessary overhead at small stage counts with worker homogeneity.
+
+The design implication: pipeline investment should go into clear dispatching rules and priority ordering, not optimization algorithms. The topology's simplicity makes sophisticated search unnecessary.
+
+## Challenges
+
+This bound assumes worker homogeneity within stages. If workers vary significantly in processing speed or quality (heterogeneous workers), the gap between simple dispatching and optimal widens and metaheuristics may recover value. Multi-agent reinforcement learning is emerging as the approach for this heterogeneous, uncertain case.
+
+---
+
+Relevant Notes:
+- [[designing coordination rules is categorically different from designing coordination outcomes as nine intellectual traditions independently confirm]] — dispatching rules are coordination rules; this claim grounds the specific complexity bound for pipeline-scale problems
+- [[mechanism design enables incentive-compatible coordination by constructing rules under which self-interested agents voluntarily reveal private information and take socially optimal actions]] — dispatching rules are a simpler variant of mechanism design where incentive compatibility is not required
+
+Topics:
+- [[_map]]

inbox/archive/2023-00-00-sciencedirect-flexible-job-shop-scheduling-review.md

@@ -6,7 +6,13 @@ url: https://www.sciencedirect.com/science/article/pii/S037722172300382X
 date: 2023-01-01
 domain: internet-finance
 format: paper
-status: unprocessed
+status: processed
+processed_by: rio
+processed_date: 2026-03-12
+claims_extracted:
+  - core/grand-strategy/hybrid-flow-shop-pipelines-with-few-stages-and-homogeneous-workers-perform-within-5-10-percent-of-optimal-with-simple-priority-dispatching-rules.md
+enrichments: []
+notes: "Source tagged internet-finance but contains no internet-finance claims. Single claim extracted to grand-strategy — scheduling theory applied to pipeline architecture. Domain mismatch in source metadata."
 tags: [pipeline-architecture, operations-research, combinatorial-optimization, job-shop-scheduling, flexible-scheduling]
 ---