Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.7 — an LLL-colourable graph gives a schedule of S(r, d) with makespan lb⋅2L\mathrm{lb}\cdot 2Llb⋅2L

Proved
FlowJobHardness.ColoringReduction.lemma_3_7

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

completenessflow-shopgraph-coloringjob-shopp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a simple graph on nnn vertices with a proper colouring into ddd classes, let r∈Nr\in\mathbb Nr∈N, and let S(r,d)S(r,d)S(r,d) be the generalized flow shop instance of the colouring reduction, with lb=r2d\mathrm{lb} = r^{2d}lb=r2d.

If the vertices of GGG can be coloured properly with LLL colours, then S(r,d)S(r,d)S(r,d) has a feasible schedule of all its jobs with makespan

Cmax⁡≤lb⋅2L=2L r2d.C_{\max} \le \mathrm{lb}\cdot 2L = 2L\, r^{2d}.Cmax​≤lb⋅2L=2Lr2d.

This is the completeness half of the reduction: a graph of small chromatic number yields an instance with a short schedule.

Formalization Note. The paper's hypothesis χ(G)=L\chi(G) = Lχ(G)=L is stated as LLL-colourability (G.Colorable L), which is all the proof uses and includes the case χ(G)=L\chi(G)=Lχ(G)=L. "A schedule with makespan lb⋅2L\mathrm{lb}\cdot 2Llb⋅2L" is read as makespan at most 2L r2d2L\,r^{2d}2Lr2d; the paper's own schedule ends at or before that time.

Preamble
import Mathlib
import Definitions.Def_JobShopLTAS_Core_Instance
import Definitions.Def_FlowJobHardness_ColoringReduction_Construction
import Definitions.Def_FlowJobHardness_ColoringReduction_Schedule

open JobShopLTAS.Core
Formal statement
namespace FlowJobHardness.ColoringReduction

/-- **Lemma 3.7** (Mastrolilli–Svensson 2011, p. 20:17). If `G` can be coloured with `L`
colours (`χ(G) = L` in the paper), then `S(r, d)` has a feasible schedule with makespan at most
`lb · 2L = 2L · r^{2d}`. -/
theorem lemma_3_7 {n d : ℕ} (G : SimpleGraph (Fin n)) (c : G.Coloring (Fin d)) (r : ℕ)
    (L : ℕ) (hL : G.Colorable L) :
    ∃ s : (inst G c r).Op → ℝ,
      (inst G c r).IsFeasibleSchedule Finset.univ s ∧
      (inst G c r).makespan Finset.univ s ≤ 2 * (L : ℝ) * (R r d : ℝ) := by sorry

end FlowJobHardness.ColoringReduction
Source
Mastrolilli, Svensson, Hardness of Approximating Flow and Job Shop Scheduling Problems, J. ACM 58(5) (2011), Article 20, p. 20:17, Lemma 3.7
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