Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 — BLS makespan bound

Proved
BurnInBatch.ListSched.proposition_1

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

approximation-boundbatch-processingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let JJJ be any finite set of jobs with positive processing times, let B>0B>0B>0 be the batch capacity, and let m>0m>0m>0 be the number of identical machines. For every ordering of the jobs in JJJ, let Cmax⁡BLS(J)C_{\max}^{\mathrm{BLS}}(J)CmaxBLS​(J) be the makespan obtained by grouping successive jobs into batches and assigning the batches to the first available machines. If Cmax⁡∗(J)C_{\max}^*(J)Cmax∗​(J) is the minimum over all valid batchings and machine assignments, then

Cmax⁡BLS(J)≤(B+1−1m)Cmax⁡∗(J).C_{\max}^{\mathrm{BLS}}(J)\le\left(B+1-\frac1m\right)C_{\max}^*(J).CmaxBLS​(J)≤(B+1−m1​)Cmax∗​(J).

Taking JJJ to be the full job set gives Proposition 1. When B=1B=1B=1, the factor becomes Graham's 2−1/m2-1/m2−1/m list-scheduling bound. The sub-instance form is also used for prefixes in the maximum-lateness analysis.

Formalization Note The list may be any permutation of JJJ, including the empty list when JJJ is empty. The published list-scheduling rule resolves simultaneous machine availability by lowest machine index; any such tie has the same makespan. The batch optimum is taken over all valid batchings, not only BLS-style consecutive batches.

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

/-- Proposition 1, p. 772, also valid for every sub-instance `J`. -/
theorem proposition_1 {n : ℕ} (p : Fin n → ℝ) (B m : ℕ)
    (J : Finset (Fin n)) (l : List (Fin n))
    (hB : 0 < B) (hm : 0 < m) (hp : ∀ j, 0 < p j)
    (hl : ListsJobs J l) :
    blsMakespan p B m l ≤
      ((B : ℝ) + 1 - 1 / (m : ℝ)) * CmaxStar p B m J := 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, Proposition 1; 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