Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1 — processing-volume lower bound

Proved
BurnInBatch.ListSched.volume_lower_bound

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

batch-processingmakespanp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Consider n>0n>0n>0 jobs with positive processing times pjp_jpj​, batch capacity B>0B>0B>0, and m>0m>0m>0 identical parallel batch machines. If Cmax⁡∗C_{\max}^*Cmax∗​ is the minimum makespan over all valid batchings and machine assignments, then

1mB∑j=1npj≤Cmax⁡∗.\frac{1}{mB}\sum_{j=1}^{n}p_j\le C_{\max}^*.mB1​j=1∑n​pj​≤Cmax∗​.

This lower bound compares the aggregate processing volume with the total batch capacity available across the machines. It is the volume estimate used in Proposition 1.

Formalization Note The paper uses one-based job indices; Lean uses Fin n. Job processing times are real and strictly positive. The optimal makespan ranges over all valid batchings, including partial and nonconsecutive batches.

Preamble
import Mathlib
import Definitions.Def_BurnInBatch_ListSched_Model
Formal statement
namespace BurnInBatch.ListSched

/-- Proof of Proposition 1, p. 772: total job processing volume divided by `mB`
is a lower bound for the optimum batch makespan. -/
theorem volume_lower_bound {n : ℕ} (p : Fin n → ℝ) (B m : ℕ)
    (hn : 0 < n) (hB : 0 < B) (hm : 0 < m)
    (hp : ∀ j, 0 < p j) :
    (∑ j : Fin n, p j) / ((m : ℝ) * (B : ℝ)) ≤
      CmaxStar p B m Finset.univ := by sorry

end BurnInBatch.ListSched
Source
Lee, Uzsoy & Martin-Vega, Efficient Algorithms for Scheduling Semiconductor Burn-In Operations, Oper. Res. 40(4) (1992), p. 772, proof of Proposition 1, display “(1/mB) Σ p_i ≤ C_max*”; https://doi.org/10.1287/opre.40.4.764
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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