Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.5, p. 794 — per-realization completion-time bound (2.1) for Algorithm CMNS

Proved
StochSchedPrec.CMNS.lemma_2_5

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

critical-chainlist-schedulingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-scheduling

Consider an instance with m≥1m\ge1m≥1 machines, acyclic precedence constraints and release dates rj≥0r_j\ge0rj​≥0 satisfying Assumption 2.1. Let LLL be a priority list that is a linear extension of the precedence constraints, β≥0\beta\ge0β≥0, μj≥0\mu_j\ge0μj​≥0, p≥0p\ge0p≥0 a realization, and let SSS be the schedule constructed by Algorithm CMNS with completion times Cj(p)=Sj+pjC_j(p)=S_j+p_jCj​(p)=Sj​+pj​. Let ℓj(p)\ell_j(p)ℓj​(p) be the length of the critical chain of jjj in this schedule (for a fixed tie-breaking rule). Then for every job jjj

Cj(p)≤m−1m ℓj(p)+1m rj+1m(∑i∈Bj(pi+βμi)+∑i∈Oj(p)pi),C_j(p)\le\frac{m-1}m\,\ell_j(p)+\frac1m\,r_j+\frac1m\Big(\sum_{i\in B_j}\big(p_i+\beta\mu_i\big)+\sum_{i\in O_j(p)}p_i\Big),Cj​(p)≤mm−1​ℓj​(p)+m1​rj​+m1​(i∈Bj​∑​(pi​+βμi​)+i∈Oj​(p)∑​pi​),

where BjB_jBj​ is the set of jobs up to and including jjj in LLL and Oj(p)O_j(p)Oj​(p) the set of jobs after jjj in LLL that are started before jjj.

This is the deterministic core of the analysis: after taking expectations it yields Theorem 2.8.

Formalization Note The paper has μj=E[Pj]\mu_j=\mathrm E[P_j]μj​=E[Pj​]; the bound holds for any nonnegative threshold vector.

Preamble
import Mathlib
import Definitions.Def_StochSchedPrec_CMNS_Model
import Definitions.Def_StochSchedPrec_CMNS_Algorithm

open MeasureTheory ProbabilityTheory
Formal statement
namespace StochSchedPrec.CMNS

theorem lemma_2_5 {V : Type*} [Fintype V] [DecidableEq V]
    (m : ℕ) (hm : 0 < m) (A : V → V → Prop) (hacyc : ∀ j, ¬ Relation.TransGen A j j)
    (r : V → ℝ) (hr : ∀ j, 0 ≤ r j) (hAss : ∀ i j, Relation.TransGen A i j → r i ≤ r j)
    (L : Fin (Fintype.card V) ≃ V) (hLE : IsLinearExtension A L)
    (β : ℝ) (hβ : 0 ≤ β) (μ : V → ℝ) (hμ : ∀ j, 0 ≤ μ j)
    (tb : V ≃ Fin (Fintype.card V))
    (p : V → ℝ) (hp : ∀ j, 0 ≤ p j) (S : V → ℝ) (hS : IsCMNSRun m A r L β μ p S) (j : V) :
    S j + p j ≤ ((m : ℝ) - 1) / m * chainLength A r tb p S j + 1 / (m : ℝ) * r j
      + 1 / (m : ℝ) * (∑ i ∈ before L j, (p i + β * μ i) + ∑ i ∈ outOfOrder L S j, p i) := by sorry

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