Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 2.4, p. 794 — CMNS charges each job at most βE[P_j], charges in [r_j(p), S_j(p)[ go to B_j, and no deliberate idle time is uncharged

Proved
StochSchedPrec.CMNS.observation_2_4

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

deliberate-idle-timelist-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 (ri≤rjr_i\le r_jri​≤rj​ whenever iii is a predecessor of jjj). Let LLL be a priority list, β≥0\beta\ge0β≥0, μj≥0\mu_j\ge0μj​≥0 (the expected processing times E[Pj]\mathrm E[P_j]E[Pj​] in the paper), p≥0p\ge0p≥0 a realization, and SSS the schedule constructed by Algorithm CMNS. Then for every job jjj:

  1. job jjj is charged no more than βμj\beta\mu_jβμj​ deliberate idle time: chargej(t)≤βμj\mathrm{charge}_j(t)\le\beta\mu_jchargej​(t)≤βμj​ for all ttt;
  2. the deliberate idle time in [rj(p),Sj(p)[[r_j(p),S_j(p)[[rj​(p),Sj​(p)[ is charged only to jobs in BjB_jBj​: a job deliberately delayed at a time t∈[rj(p),Sj(p)[t\in[r_j(p),S_j(p)[t∈[rj​(p),Sj​(p)[ lies in BjB_jBj​;
  3. there is no uncharged deliberate idle time: whenever a machine is idle at ttt while some job of the residual list is available, some job is deliberately delayed at ttt, so the idle machines' time is charged to it.

These three facts are what the completion-time bound of Lemma 2.5 uses about the algorithm.

Formalization Note The paper states the observation for μj=E[Pj]\mu_j=\mathrm E[P_j]μj​=E[Pj​]; the statement here holds for every nonnegative threshold vector μ\muμ, since the algorithm uses E[Pj]\mathrm E[P_j]E[Pj​] only through the threshold. Assumption 2.1 is the standing assumption of §2 and is carried as a hypothesis.

Preamble
import Mathlib
import Definitions.Def_StochSchedPrec_CMNS_Model
import Definitions.Def_StochSchedPrec_CMNS_Algorithm

open MeasureTheory ProbabilityTheory
Formal statement
namespace StochSchedPrec.CMNS

theorem observation_2_4 {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) (β : ℝ) (hβ : 0 ≤ β) (μ : V → ℝ) (hμ : ∀ j, 0 ≤ μ j)
    (p : V → ℝ) (hp : ∀ j, 0 ≤ p j) (S : V → ℝ) (hS : IsCMNSRun m A r L β μ p S) :
    (∀ (j : V) (t : ℝ), charge m A r L p S j t ≤ β * μ j) ∧
    (∀ (j : V) (t : ℝ), availTime A r p S j ≤ t → t < S j →
      ∀ k, IsDelayed A r L p S k t → k ∈ before L j) ∧
    (∀ t : ℝ, busy p S t < m → (∃ i, t < S i ∧ avail A r p S i t) →
      ∃ k, IsDelayed A r L p S k t) := 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, Observation 2.4
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