Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (3.1) — MjLP=∫01tj(α) dαM^{LP}_j=\int_0^1 t_j(\alpha)\,d\alphaMjLP​=∫01​tj​(α)dα

Proved
SingleMachineSched.AlphaJSched.eq_3_1

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let nnn jobs have integral processing times pj>0p_j>0pj​>0, integral release dates rj≥0r_j\ge0rj​≥0 and weights wj>0w_j>0wj​>0, indexed in nonincreasing order of wj/pjw_j/p_jwj​/pj​. For every job jjj, the mean busy time of jjj in the LP schedule is the average of its α\alphaα-points:

MjLP=∫01tj(α) dα.M^{LP}_j=\int_0^1 t_j(\alpha)\,d\alpha .MjLP​=∫01​tj​(α)dα.

This identity turns a bound on the completion time of jjj that is linear in tj(α)t_j(\alpha)tj​(α) into a bound in terms of MjLPM^{LP}_jMjLP​ after integrating over a random α\alphaα.

Formalization Note. The integral is the Lebesgue integral over (0,1](0,1](0,1] of α↦tj(α)\alpha\mapsto t_j(\alpha)α↦tj​(α), the α\alphaα-points taken in the LP schedule. The identity does not use the weights or their order; they are the paper's standing assumptions and are kept as hypotheses.

Preamble
import Mathlib
import Definitions.Def_SingleMachineSched_AlphaJSched_LPSchedule
import Definitions.Def_SingleMachineSched_AlphaJSched_AlphaPoints
Formal statement
namespace SingleMachineSched.AlphaJSched

/-- Equation (3.1): the mean busy time of job `j` in the LP schedule is the average of its
`α`-points over `α ∈ (0, 1]`. -/
theorem eq_3_1 {n : ℕ} (p r : Fin n → ℕ) (w : Fin n → ℝ)
    (hp : ∀ j, 0 < p j) (hw : ∀ j, 0 < w j)
    (hsort : ∀ j k : Fin n, j ≤ k → w k / p k ≤ w j / p j) (j : Fin n) :
    mLP p r j = ∫ a in Set.Ioc (0 : ℝ) 1, alphaPoint p (lpSet p r) j a := by sorry

end SingleMachineSched.AlphaJSched
Source
Goemans, Queyranne, Schulz, Skutella & Wang, Single Machine Scheduling with Release Dates, SIAM J. Discrete Math. 15(2) (2002), p. 176, Section 3, Eq. (3.1)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me