Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2 — some optimal P/B/Cmax⁡P/B/C_{\max}P/B/Cmax​ schedule uses exactly the full batches of consecutive longest jobs

Proved
BurnInBatch.BatchLPT.proposition_2

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

batch-processingexchange-argumentmakespanp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Consider nnn jobs with positive processing times pjp_jpj​ on m≥1m \ge 1m≥1 identical batch processing machines of capacity B≥1B \ge 1B≥1, all jobs available at time 000. Re-index the jobs in nonincreasing order of processing time, pj1≥⋯≥pjnp_{j_1} \ge \dots \ge p_{j_n}pj1​​≥⋯≥pjn​​ (ties in any order), and let

B1={j1,…,jB}, B2={jB+1,…,j2B}, …, B⌈n/B⌉B_1 = \{j_1, \dots, j_B\},\ B_2 = \{j_{B+1}, \dots, j_{2B}\},\ \dots,\ B_{\lceil n/B\rceil}B1​={j1​,…,jB​}, B2​={jB+1​,…,j2B​}, …, B⌈n/B⌉​

be the successive groups of BBB consecutive jobs, the last one possibly smaller.

Proposition 2. There is an optimal schedule of P/B/Cmax⁡P/B/C_{\max}P/B/Cmax​, that is, a valid batching SSS and an assignment σ\sigmaσ of its batches to machines with makespan equal to C∗C^*C∗, whose batches are exactly B1,…,B⌈n/B⌉B_1, \dots, B_{\lceil n/B\rceil}B1​,…,B⌈n/B⌉​ (in some order).

Being exactly these sets is the paper's statement that "all batches will contain consecutive jobs" and "all batches, except possibly the one containing the highest indexed job, will be full": a partition of the ranked list into intervals of consecutive jobs, all of size BBB except the one containing the last job, is exactly B1,B2,…B_1, B_2, \dotsB1​,B2​,…. The result fixes the batch structure of an optimal schedule in advance.

Formalization Note. The ranking is any list l of all jobs, nonincreasing in ppp; the statement holds for every such list. C∗C^*C∗ ranges over all valid batchings (any sizes ≤B\le B≤B, any grouping), not only over consecutive ones.

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_2 {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) :
    ∃ S : List (Finset (Fin n)), ∃ σ : Fin S.length → Fin m,
      IsBatching n B S ∧ S.Perm (blptBatches B l) ∧
      makespan (BurnInBatch.ListSched.batchTimes p S) σ = 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. 772, Proposition 2
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