Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1, p. 797 — load inequalities Σ_{j∈W} E[P_j] E[C^Π_j] ≥ f(W) for every nonanticipatory policy

Proved
StochSchedPrec.CMNS.theorem_3_1

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

load-inequalitieslp-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-scheduling

Consider m≥1m\ge1m≥1 machines, acyclic precedence constraints, release dates rj≥0r_j\ge0rj​≥0 and independent nonnegative processing times PjP_jPj​ whose coefficients of variation are bounded by Δ\sqrt\DeltaΔ​ for some Δ≥0\Delta\ge0Δ≥0. Let Π\PiΠ be any feasible nonanticipatory scheduling policy with integrable completion times CjΠ(P)C^\Pi_j(P)CjΠ​(P). Then for every W⊆VW\subseteq VW⊆V

∑j∈WE[Pj] E[CjΠ(P)]≥f(W),\sum_{j\in W}\mathrm E[P_j]\,\mathrm E[C^\Pi_j(P)]\ge f(W),j∈W∑​E[Pj​]E[CjΠ​(P)]≥f(W),

with fff the set function (3.1).

These load inequalities, due to Möhring, Schulz and Uetz (J. ACM 1999, Cor. 3.1), are the polyhedral lower bound on which the LP relaxation of §3 rests.

Formalization Note Assumption 2.1 plays no role and is dropped. Comparator policies are required to have integrable completion times; a policy with E[CjΠ]=∞\mathrm E[C^\Pi_j]=\inftyE[CjΠ​]=∞ satisfies any upper bound against it trivially, and the requirement prevents the Bochner integral from returning its default value 000. Comparator policies are also required to be measurable for the law of PPP (almost everywhere equal to a Borel map): §5, p. 800, requires every policy to be a universally measurable map, which implies this. Without it a non-measurable policy on a suitably enlarged probability space can correlate its decisions with unobserved processing times, and the load inequalities fail.

Preamble
import Mathlib
import Definitions.Def_StochSchedPrec_CMNS_Model
import Definitions.Def_StochSchedPrec_CMNS_Algorithm

open MeasureTheory ProbabilityTheory
Formal statement
namespace StochSchedPrec.CMNS

theorem theorem_3_1 {V : Type*} [Fintype V] [DecidableEq V]
    {Ω : Type*} [MeasurableSpace Ω] {Pr : Measure Ω} [IsProbabilityMeasure Pr]
    (m : ℕ) (hm : 0 < m) (A : V → V → Prop) (hacyc : ∀ j, ¬ Relation.TransGen A j j)
    (r : V → ℝ) (hr : ∀ j, 0 ≤ r j)
    (P : V → Ω → ℝ) (hP : IsStochModel Pr P) (Δ : ℝ) (hΔ : 0 ≤ Δ) (hCV : HasCVBound Pr P Δ)
    (pol : (V → ℝ) → V → ℝ) (hpol : IsAdmissiblePolicy m A r Pr P pol)
    (hpolm : AEMeasurable pol (Pr.map (fun ω k => P k ω))) (W : Finset V) :
    loadFn m Δ (fun j => ∫ ω, P j ω ∂Pr) W
      ≤ ∑ j ∈ W, (∫ ω, P j ω ∂Pr) * ∫ ω, (pol (fun k => P k ω) j + P j ω) ∂Pr := by sorry

end StochSchedPrec.CMNS
Source
Skutella and Uetz, Stochastic machine scheduling with precedence constraints, SIAM J. Comput. 34(4) (2005) 788–802, p. 797, Theorem 3.1 (citing Möhring, Schulz, Uetz, J. ACM 46 (1999), Cor. 3.1), eq. (3.2) with (3.1) p. 796
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