rio: extract claims from 2023-00-00-sciencedirect-flexible-job-shop-scheduling-review

- What: 1 claim in foundations/collective-intelligence on dispatching rules for hybrid flow-shop pipelines
- Why: OR literature establishes that simple priority rules achieve near-optimal scheduling for pipelines with fixed stage sequences and homogeneous workers — directly applicable to the Teleo research → extract → eval pipeline
- Connections: links to coordination rules claim (designing rules ≠ designing outcomes) and protocol design claim

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

foundations/collective-intelligence/sequential multi-stage pipelines with parallel workers at each stage achieve near-optimal scheduling with simple priority dispatching rules.md

@@ -0,0 +1,35 @@
+---
+type: claim
+domain: collective-intelligence
+description: "For hybrid flow-shops with few stages (≤5) and roughly homogeneous workers within each stage, priority dispatching rules (shortest-job-first, FIFO) perform within 5-10% of optimal, making metaheuristic complexity unjustified"
+confidence: likely
+source: "Rio, via ScienceDirect FJSP review (2023); hybrid flow-shop scheduling OR literature"
+created: 2026-03-12
+depends_on: []
+challenged_by: []
+---
+
+# sequential multi-stage pipelines with parallel workers at each stage achieve near-optimal scheduling with simple priority dispatching rules
+
+For knowledge production pipelines with a fixed stage sequence and multiple parallel workers at each stage — the structure operations research calls a **hybrid flow-shop** — simple priority dispatching rules (shortest-job-first, FIFO within priority classes) perform within 5-10% of optimal scheduling, as documented in the flexible job shop scheduling literature.
+
+The general Flexible Job Shop Scheduling Problem (FJSP) is NP-complete and motivates complex metaheuristic approaches — genetic algorithms, simulated annealing, tabu search. But those approaches are justified for *general* job-shops: many machines, heterogeneous capabilities, variable routing, dynamic task arrival. A hybrid flow-shop occupies a computationally easier subclass. When stage count is low (≤5) and workers within each stage have roughly similar throughput, the search space contracts enough that simple rules close the gap to within 5-10% of optimum. The engineering overhead of implementing metaheuristics is rarely justified in that regime.
+
+**Structural conditions that make dispatching rules sufficient:**
+- Fixed stage sequence (all work items follow the same path through stages — no job-shop branching)
+- Multiple workers at each stage, each roughly interchangeable within a stage
+- Low stage count (3-5 stages)
+- Within-stage worker homogeneity (similar throughput distributions per stage)
+
+**When this breaks down:** When worker heterogeneity *within* a stage becomes significant — due to specialization, skill variation, or domain-specific task-worker fit — the problem shifts toward the general FJSP and machine-assignment decisions carry more weight. In that regime, the OR literature increasingly favors multi-agent reinforcement learning for dynamic scheduling, which can adapt to uncertainty and worker heterogeneity that static rules cannot handle.
+
+The practical implication: before investing in sophisticated scheduling infrastructure for a multi-stage pipeline, verify whether the hybrid flow-shop conditions hold. If they do, a well-chosen dispatching rule (shortest-job-first for throughput, priority-FIFO for deadline compliance) likely dominates the engineering tradeoff.
+
+---
+
+Relevant Notes:
+- [[designing coordination rules is categorically different from designing coordination outcomes as nine intellectual traditions independently confirm]] — pipeline scheduling is coordination rule design; optimal rules emerge from structural analysis, not outcome optimization
+- [[protocol design enables emergent coordination of arbitrary complexity as Linux Bitcoin and Wikipedia demonstrate]] — simple rules generalize: dispatching rules are protocols that produce efficient coordination without centralized control
+
+Topics:
+- [[_map]]

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

@@ -10,9 +10,9 @@ 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
+  - foundations/collective-intelligence/sequential multi-stage pipelines with parallel workers at each stage achieve near-optimal scheduling 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."
+notes: "Source tagged internet-finance but contains no internet-finance claims. Single claim extracted to collective-intelligence — scheduling theory applied to pipeline architecture. Domain mismatch in source metadata."
 tags: [pipeline-architecture, operations-research, combinatorial-optimization, job-shop-scheduling, flexible-scheduling]
 ---