Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3 — C(BLPT)≤(4/3−1/(3m)) C∗C(\mathrm{BLPT}) \le (4/3 - 1/(3m))\,C^*C(BLPT)≤(4/3−1/(3m))C∗ on parallel batch machines

Proved
BurnInBatch.BatchLPT.proposition_3

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

approximationbatch-processinglptmakespanp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Consider nnn jobs with positive processing times pjp_jpj​, all available at time 000, on m≥1m \ge 1m≥1 identical batch processing machines, each processing up to B≥1B \ge 1B≥1 jobs at a time, a batch taking as long as its longest job. Let C∗C^*C∗ be the optimal makespan of this problem P/B/Cmax⁡P/B/C_{\max}P/B/Cmax​, the minimum over all ways of forming batches and assigning them to machines. Let C(BLPT)C(\mathrm{BLPT})C(BLPT) be the makespan produced by Algorithm BLPT: rank the jobs in nonincreasing order of processing time, group successive blocks of BBB jobs into batches, order the batches in nonincreasing order of batch time and assign each in turn to a machine that becomes free first. Then

C(BLPT)≤(43−13m)C∗.C(\mathrm{BLPT}) \le \left(\frac43 - \frac1{3m}\right) C^* .C(BLPT)≤(34​−3m1​)C∗.

For one machine the factor is 111, so BLPT is then optimal. The proposition transfers Graham's worst-case bound for the LPT rule on ordinary parallel machines to batch machines.

Formalization Note. The bound is claimed for every run of BLPT: every ranking l nonincreasing in ppp (ties arbitrary) and every ordering bl of its batches nonincreasing in batch time. "Assign them to the machines as they become free" is the published least-loaded list-scheduling rule. "1/3m1/3m1/3m" in the paper is 1/(3m)1/(3m)1/(3m). C∗C^*C∗ ranges over all valid batchings, not only the consecutive ones of Step 1.

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_3 {n m B : ℕ} (hm : 0 < m) (hB : 0 < B) (p : Fin n → ℝ)
    (hp : ∀ j, 0 < p j) (l : List (Fin n)) (hl : IsLPTList p l)
    (bl : List (Finset (Fin n))) (hbl : IsBLPTOrder p B l bl) :
    blptMakespan m p bl ≤ (4 / 3 - 1 / (3 * (m : ℝ))) * optBatchMakespan n m B p := 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 3 (Algorithm BLPT, p. 772)
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