Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.3, p. 799 — Graham's schedule processes no job of A_j in [r_j(p), S_j(p)[ for in-forests

Proved
StochSchedPrec.InForest.lemma_4_3

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

in-forestlist-schedulingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-scheduling

Let the precedence constraints AAA on the job set VVV form an acyclic in-forest (each job has at most one successor), let m≥1m\ge 1m≥1, and let LLL be a priority list that is a linear extension of the precedence constraints. Let p≥0p\ge 0p≥0 be any realization of the processing times and SSS the schedule constructed by Graham's list scheduling with list LLL on mmm machines (no release dates). For a job jjj let rj(p)r_j(p)rj​(p) be the earliest time at which jjj is available, and AjA_jAj​ the set of jobs after jjj in LLL. Then no job of AjA_jAj​ is in process during [rj(p),Sj(p)[[r_j(p),S_j(p)[[rj​(p),Sj​(p)[:

∀k∈Aj  ∀t∈[rj(p),Sj(p)[:¬ (Sk≤t<Sk+pk).\forall k\in A_j\ \ \forall t\in[r_j(p),S_j(p)[:\qquad \neg\,\big(S_k\le t<S_k+p_k\big).∀k∈Aj​  ∀t∈[rj​(p),Sj​(p)[:¬(Sk​≤t<Sk​+pk​).

The lemma is the in-forest substitute for deliberate idle time: in the interval where jjj waits, the machines are occupied only by jobs of higher priority. It drives the per-realization completion-time bound of Lemma 4.4.

Formalization Note Zero processing times are allowed (pj≥0p_j\ge 0pj​≥0), as in the paper.

Preamble
import Mathlib
import Definitions.Def_StochSchedPrec_InForest_Model
import Definitions.Def_StochSchedPrec_InForest_LP
import Definitions.Def_StochSchedPrec_InForest_Graham
Formal statement
namespace StochSchedPrec.InForest

theorem lemma_4_3 {V : Type*} [Fintype V] [DecidableEq V]
    (m : ℕ) (hm : 0 < m) (A : V → V → Prop) (hacyc : IsAcyclic A) (hforest : IsInForest A)
    (L : Fin (Fintype.card V) ≃ V) (hL : StochSchedPrec.CMNS.IsLinearExtension A L)
    (p : V → ℝ) (hp : IsNonneg p) (S : V → ℝ) (hS : IsGraham A m L p S)
    (j k : V) (hk : k ∈ Aset L j) (t : ℝ) (ht₁ : availTime A p S j ≤ t) (ht₂ : t < S j) :
    ¬ (S k ≤ t ∧ t < S k + p k) := by sorry

end StochSchedPrec.InForest
Source
Skutella and Uetz, Stochastic machine scheduling with precedence constraints, SIAM J. Comput. 34(4) (2005) 788–802, p. 799, Lemma 4.3
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