Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5 — relative Lmax⁡L_{\max}Lmax​ error of BLPT is at most (1/3−1/(3m))+dmax⁡/(L∗+dmax⁡)(1/3 - 1/(3m)) + d_{\max}/(L^* + d_{\max})(1/3−1/(3m))+dmax​/(L∗+dmax​)

Proved
BurnInBatch.BatchLPT.proposition_5

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

approximationbatch-processinglptmaximum-latenessp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Consider n≥1n \ge 1n≥1 jobs with positive processing times pjp_jpj​ and nonnegative due dates djd_jdj​, all available at time 000, on m≥1m \ge 1m≥1 identical batch machines of capacity B≥1B \ge 1B≥1. Let LLL be the maximum lateness max⁡j(Cj−dj)\max_j (C_j - d_j)maxj​(Cj​−dj​) of the schedule produced by Algorithm BLPT, L∗L^*L∗ the optimal maximum lateness of P/B/Lmax⁡P/B/L_{\max}P/B/Lmax​ (over all batchings, assignments and processing orders), and dmax⁡=max⁡jdjd_{\max} = \max_j d_jdmax​=maxj​dj​. Then

L−L∗L∗+dmax⁡≤(13−13m)+dmax⁡L∗+dmax⁡.\frac{L - L^*}{L^* + d_{\max}} \le \left(\frac13 - \frac1{3m}\right) + \frac{d_{\max}}{L^* + d_{\max}} .L∗+dmax​L−L∗​≤(31​−3m1​)+L∗+dmax​dmax​​.

The ratio (L−L∗)/(L∗+dmax⁡)(L - L^*)/(L^* + d_{\max})(L−L∗)/(L∗+dmax​) is used because L∗L^*L∗ may be negative; under the hypotheses L∗+dmax⁡>0L^* + d_{\max} > 0L∗+dmax​>0, so both fractions are well defined. Proposition 5 is the Lmax⁡L_{\max}Lmax​ counterpart of Proposition 3.

Formalization Note. The hypothesis dj≥0d_j \ge 0dj​≥0 is not printed in the paper; its proof needs it (it uses L∗(Sk)≥Cmax⁡∗(Sk)−dmax⁡L^*(S_k) \ge C^*_{\max}(S_k) - d_{\max}L∗(Sk​)≥Cmax∗​(Sk​)−dmax​ and divides by L∗(Sk)+dmax⁡L^*(S_k) + d_{\max}L∗(Sk​)+dmax​), and it guarantees L∗+dmax⁡>0L^* + d_{\max} > 0L∗+dmax​>0: for a job jjj with dj=dmax⁡d_j = d_{\max}dj​=dmax​, every schedule has Lmax⁡+dmax⁡≥Cj≥pj>0L_{\max} + d_{\max} \ge C_j \ge p_j > 0Lmax​+dmax​≥Cj​≥pj​>0. The bound is claimed for every BLPT run (every ranking l and every batch order bl, as in Proposition 3), with job completion times given by least-loaded list scheduling of the ordered batches.

Preamble
import Mathlib
import Definitions.Def_NumStochOpt_ListScheduling_ListSchedule
import Definitions.Def_NumStochOpt_ListScheduling_Makespan
import Definitions.Def_BurnInBatch_BatchLPT_Model
import Definitions.Def_BurnInBatch_BatchLPT_BLPT
Formal statement
namespace BurnInBatch.BatchLPT

open NumStochOpt.ListScheduling

theorem proposition_5 {n m B : ℕ} (hn : 0 < n) (hm : 0 < m) (hB : 0 < B)
    (p d : Fin n → ℝ) (hp : ∀ j, 0 < p j) (hd : ∀ j, 0 ≤ d j)
    (l : List (Fin n)) (hl : IsLPTList p l)
    (bl : List (Finset (Fin n))) (hbl : IsBLPTOrder p B l bl) :
    (blptLmax m p d bl - optLmax n m B p d) / (optLmax n m B p d + dMax d) ≤
      (1 / 3 - 1 / (3 * (m : ℝ))) + dMax d / (optLmax n m B p d + dMax d) := by sorry

end BurnInBatch.BatchLPT
Source
Lee, Uzsoy & Martin-Vega, Efficient Algorithms for Scheduling Semiconductor Burn-In Operations, Oper. Res. 40(4) (1992), p. 773, Proposition 5 (ratio defined on p. 773 before Proposition 4)
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