Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 772 — P/B/Cmax⁡P/B/C_{\max}P/B/Cmax​ equals the unit-capacity P//Cmax⁡P//C_{\max}P//Cmax​ problem on the aggregate batch jobs

Proved
BurnInBatch.BatchLPT.reduction_to_unit_capacity

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

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

Let nnn jobs with positive processing times pjp_jpj​ be scheduled on m≥1m \ge 1m≥1 identical batch machines of capacity B≥1B \ge 1B≥1. Rank the jobs in nonincreasing order of processing time (ties in any order) and let B1,…,BMB_1, \dots, B_MB1​,…,BM​, M=⌈n/B⌉M = \lceil n/B \rceilM=⌈n/B⌉, be the successive groups of BBB jobs of the ranked list. View each batch as a single aggregate job of length p(Bk)=max⁡j∈Bkpjp(B_k) = \max_{j \in B_k} p_jp(Bk​)=maxj∈Bk​​pj​. Then the optimal makespan of the batch problem equals the optimal makespan of the ordinary (unit-capacity) parallel-machine problem P//Cmax⁡P//C_{\max}P//Cmax​ on the aggregate jobs:

C∗=min⁡σ:{1,…,M}→{1,…,m} max⁡i ∑k:σ(k)=ip(Bk).C^* = \min_{\sigma : \{1,\dots,M\} \to \{1,\dots,m\}}\ \max_{i}\ \sum_{k : \sigma(k) = i} p(B_k).C∗=σ:{1,…,M}→{1,…,m}min​ imax​ k:σ(k)=i∑​p(Bk​).

This is the reduction the paper draws from Proposition 2; it is what allows Graham's analysis of LPT for P//Cmax⁡P//C_{\max}P//Cmax​ to be transferred to the batch problem.

Formalization Note. The right-hand side is the published optMakespan on the item sequence of batch times of blptBatches B l; the left-hand side optBatchMakespan ranges over every valid batching.

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 reduction_to_unit_capacity {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) :
    optBatchMakespan n m B p =
      optMakespan (blptBatches B l).length m (BurnInBatch.ListSched.batchTimes p (blptBatches B l)) := by sorry

end BurnInBatch.BatchLPT
Source
Lee, Uzsoy & Martin-Vega, Efficient Algorithms for Scheduling Semiconductor Burn-In Operations, Oper. Res. 40(4) (1992), p. 772, §5, text after Proposition 2: "Thus, the P/B/C_max problem can be viewed as an equivalent unit capacity machine P//C_max problem"
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