Theorem 1.1 (explicit form) — every schedule of has makespan at least , with
ProvedFlowJobHardness.FlowShopGap.theorem_1_1Let and be natural numbers and let be the flow shop instance of Section 2.2.1. Then
- every job of has length and every machine has load , so that ;
- every feasible schedule of has makespan
The paper states Theorem 1.1 as "there exist flow shop instances with optimal makespan ". Its proof (§2.2.2) establishes the explicit bound above for every feasible schedule, and then takes : then and . The explicit bound is what is formalized; the asymptotic corollary is not.
The result answers negatively the question of Feige and Scheideler whether flow shops always admit schedules of length : the trivial lower bound can be off by an unbounded factor.
Formalization Note The model is the published job shop model JobShopLTAS.Core.Instance; a feasible schedule has nonnegative start times, chain precedence within each job, and pairwise non-overlapping operations on each machine (so a zero-length operation cannot sit strictly inside another operation on its machine). The makespan is the largest completion time of an operation. The threshold makes explicit the paper's "sufficiently large ". For the instance is empty and the bound reads .
import Mathlib import Definitions.Def_JobShopLTAS_Core_Instance import Definitions.Def_FlowJobHardness_FlowShopGap_Construction open JobShopLTAS.Core
namespace FlowJobHardness.FlowShopGap
/-- Theorem 1.1 (p. 20:4), in the explicit form its proof (§2.2.2) gives: for every `r ≥ 8`
and every `d`, in the flow shop instance `F(r, d)` every job has length `r^{2d}` and every
machine has load `r^{2d}` (so `lb = r^{2d}`), and every feasible schedule has makespan at
least `min(r, d/4) · r^{2d}`. -/
theorem theorem_1_1 (r d : ℕ) (hr : 8 ≤ r) :
(∀ q : Fin (size r d), (inst r d).jobLength q = (r : ℝ) ^ (2 * d)) ∧
(∀ t : Fin (size r d), (inst r d).load t = (r : ℝ) ^ (2 * d)) ∧
∀ s : (inst r d).Op → ℝ, (inst r d).IsFeasibleSchedule Finset.univ s →
(r : ℝ) ^ (2 * d) * min (r : ℝ) ((d : ℝ) / 4) ≤ (inst r d).makespan Finset.univ s := by sorry
end FlowJobHardness.FlowShopGap
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.