Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 3.6 — in S(r, d) every job length and every machine load is r2dr^{2d}r2d, and a job has at most (Δ+1)r2d(\Delta+1)r^{2d}(Δ+1)r2d operations

Proved
FlowJobHardness.ColoringReduction.remark_3_6

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

flow-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 r2dnr^{2d}nr2dn machines and r2dnr^{2d}nr2dn jobs. Then:

  1. every job has length (total processing time) r2dr^{2d}r2d;
  2. every machine has load (total processing time of the operations assigned to it) r2dr^{2d}r2d;
  3. if every vertex of GGG has degree at most Δ\DeltaΔ, then every job has at most (Δ+1) r2d(\Delta+1)\,r^{2d}(Δ+1)r2d operations.
ℓj=r2d,Pm=r2d,μj≤(Δ+1) r2d.\ell_j = r^{2d}, \qquad P_m = r^{2d}, \qquad \mu_j \le (\Delta+1)\, r^{2d}.ℓj​=r2d,Pm​=r2d,μj​≤(Δ+1)r2d.

Consequently the trivial lower bound lb=max⁡(max⁡jℓj,max⁡mPm)\mathrm{lb} = \max(\max_j \ell_j, \max_m P_m)lb=max(maxj​ℓj​,maxm​Pm​) on the optimal makespan equals r2dr^{2d}r2d, the unit in which all bounds of the reduction are expressed.

Formalization Note. The machine and job counts are definitional (both types are Fin (r^{2d} n)), so only the three listed properties are stated. The degree bound Δ\DeltaΔ is a hypothesis deg⁡(v)≤Δ\deg(v)\le\Deltadeg(v)≤Δ for all vvv rather than the maximum degree itself, which makes the statement apply to every upper bound. The section introduction (p. 20:12) states the weaker count "at most d r2dd\,r^{2d}dr2d operations"; the two agree when d=Δ+1d = \Delta+1d=Δ+1, as in the proof of Theorem 1.2.

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

/-- **Remark 3.6** (Mastrolilli–Svensson 2011, p. 20:17). In `S(r, d)` (which has `r^{2d} n`
machines and `r^{2d} n` jobs by construction) every job has length `r^{2d}`, every machine has
load `r^{2d}`, and if every vertex of `G` has degree at most `Δ` then every job has at most
`(Δ + 1) r^{2d}` operations. -/
theorem remark_3_6 {n d : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj]
    (c : G.Coloring (Fin d)) (r : ℕ) :
    (∀ q : Fin (size r d n), (inst G c r).jobLength q = (R r d : ℝ)) ∧
    (∀ p : Fin (size r d n), (inst G c r).load p = (R r d : ℝ)) ∧
    (∀ Δ : ℕ, (∀ v : Fin n, G.degree v ≤ Δ) →
      ∀ q : Fin (size r d n), (inst G c r).μ q ≤ (Δ + 1) * 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, Remark 3.6
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