Example 2, Case 2, Stage 8, p. 293 — machine 2 clears buffer 2 at with
ProvedKumarSeidman.TwoType.case2_stage8Consider the system of Example 2 with positive processing times and positive set-up times . Assume (7), , and the capacity condition (1), and .
Start at from , with machine 1 set up for buffer 4 and machine 2 set up for buffer 3. There is such that for every every clearing trajectory from this state satisfies, with
the identity
and at machine 1 is set up for buffer 1 and machine 2 is set up for buffer 2 (which it has just cleared).
The state at is the mirror image of the initial state: the role of buffers 1, 2 and machine 1 is now played by buffers 3, 4 and machine 2. The level of buffer 3 is , the amount that arrived since machine 2 last served it.
Formalization Note The paper's is . " large enough" is rendered as . Conditions (8)–(10) are not assumed (the paper states they are unnecessary for Case 2). The denominator is positive because by (1).
import Mathlib import Definitions.Def_KumarSeidman_TwoType_Example2
namespace KumarSeidman.TwoType
open Example2
/-- Example 2, Case 2, Stage 8 (p. 293): under (7) and the capacity condition (1), for every
large enough `ξ`, every clearing trajectory from `x(0) = (ξ, 0, 0, 0)` with machine 1 set up
for buffer 4 and machine 2 for buffer 3 reaches at
`t₉ = (ξ + τ₂⁻¹(δ₁ + δ₂))/(τ₂⁻¹ − 1)` the state `x(t₉) = (0, 0, t₉ − δ₁, 0)`, with machine 1
set up for buffer 1 and machine 2 for buffer 2. -/
theorem case2_stage8 (τ₁ τ₂ τ₃ τ₄ δ₁ δ₂ δ₃ δ₄ : ℝ)
(hτ₁ : 0 < τ₁) (hτ₂ : 0 < τ₂) (hτ₃ : 0 < τ₃) (hτ₄ : 0 < τ₄)
(hδ₁ : 0 < δ₁) (hδ₂ : 0 < δ₂) (hδ₃ : 0 < δ₃) (hδ₄ : 0 < δ₄)
(h7 : τ₂ + τ₄ > 1) (h1₁ : τ₁ + τ₄ < 1) (h1₂ : τ₂ + τ₃ < 1) :
∃ ξ₀ : ℝ, ∀ ξ ≥ ξ₀, ∀ T : (example2 τ₁ τ₂ τ₃ τ₄ δ₁ δ₂ δ₃ δ₄).Schedule,
T.IsClearingFrom (levels ξ 0 0 0) (setups b₄ b₃) →
let t₉ := (ξ + τ₂⁻¹ * (δ₁ + δ₂)) / (τ₂⁻¹ - 1)
(∀ b, T.x b t₉ = levels 0 0 (t₉ - δ₁) 0 b) ∧ T.SetupFor m₁ t₉ b₁ ∧
T.SetupFor m₂ t₉ b₂ := by sorry
end KumarSeidman.TwoType
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.