Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1 (explicit form) — every schedule of F(r,d)F(r,d)F(r,d) has makespan at least min⁡(r,d/4)⋅lb\min(r,d/4)\cdot\mathrm{lb}min(r,d/4)⋅lb, with lb=r2d\mathrm{lb}=r^{2d}lb=r2d

Proved
FlowJobHardness.FlowShopGap.theorem_1_1

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

flow-shopinapproximabilityjob-shoplower-boundmakespanp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let r≥8r\ge8r≥8 and ddd be natural numbers and let F(r,d)F(r,d)F(r,d) be the flow shop instance of Section 2.2.1. Then

  1. every job of F(r,d)F(r,d)F(r,d) has length r2dr^{2d}r2d and every machine has load r2dr^{2d}r2d, so that lb=max⁡(C,D)=r2d\mathrm{lb}=\max(C,D)=r^{2d}lb=max(C,D)=r2d;
  2. every feasible schedule sss of F(r,d)F(r,d)F(r,d) has makespan
Cmax⁡(s) ≥ r2d⋅min⁡(r, d4)=lb⋅min⁡(r, d4).C_{\max}(s)\ \ge\ r^{2d}\cdot\min\Bigl(r,\ \frac d4\Bigr)=\mathrm{lb}\cdot\min\Bigl(r,\ \frac d4\Bigr).Cmax​(s) ≥ r2d⋅min(r, 4d​)=lb⋅min(r, 4d​).

The paper states Theorem 1.1 as "there exist flow shop instances with optimal makespan Ω(lb⋅log⁡lb/log⁡log⁡lb)\Omega(\mathrm{lb}\cdot\log\mathrm{lb}/\log\log\mathrm{lb})Ω(lb⋅loglb/logloglb)". Its proof (§2.2.2) establishes the explicit bound above for every feasible schedule, and then takes r=dr=dr=d: then lb=d2d\mathrm{lb}=d^{2d}lb=d2d and d=Θ(log⁡lb/log⁡log⁡lb)d=\Theta(\log\mathrm{lb}/\log\log\mathrm{lb})d=Θ(loglb/logloglb). 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 O(lb)O(\mathrm{lb})O(lb): 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 r≥8r\ge8r≥8 makes explicit the paper's "sufficiently large rrr". For d=0d=0d=0 the instance is empty and the bound reads 0≤00\le00≤0.

Preamble
import Mathlib
import Definitions.Def_JobShopLTAS_Core_Instance
import Definitions.Def_FlowJobHardness_FlowShopGap_Construction

open JobShopLTAS.Core
Formal statement
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
Source
Mastrolilli, Svensson, Hardness of Approximating Flow and Job Shop Scheduling Problems, J. ACM 58(5) (2011), Article 20, p. 20:4, Theorem 1.1; explicit form from §2.2.2, pp. 20:10-20:11
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me