Theorem 4.4 — LBFS fluid stability in every reentrant line
ProvedDaiWeissFluid.LBFS.theorem4_4Consider any reentrant line with finitely many stations and classes, positive mean service times , and nominal station workloads for every station . Give higher priority to later route stages: the Last-Buffer-First-Served (LBFS) ranking is . Then its preemptive-resume priority fluid model is stable in the sense of Definition 1.3:
Here and the same emptying time works for every fluid solution. The result supplies a policy-independent stability guarantee for the LBFS discipline across every route and station assignment satisfying the load condition.
Formalization Note Classes and stations are 0-based Fin indices, so LBFS is Fin.revPerm. The priority condition (4.4) is represented by the complementary interval condition ConstantWhile; equations are imposed on nonnegative time. Positive makes the service rates meaningful. The paper assumes throughout. The empty-route case is harmless in the theorem: the normalization is impossible when .
import Mathlib import Definitions.Def_DaiWeissFluid_LBFS_FluidModel
namespace DaiWeissFluid.LBFS
/-- Theorem 4.4: every LBFS priority fluid model under (1.7) is stable. -/
theorem theorem4_4 {I K : ℕ} (L : ReentrantLine I K)
(hm : ∀ k, 0 < L.m k) (hρ : ∀ i, L.ρ i < 1) :
DaiWeissFluid.ThreeBuffer.FluidStable (L.IsPrioritySolution Fin.revPerm) := by sorry
end DaiWeissFluid.LBFS
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.