Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Justification of DP2 — some minimum-makespan schedule with Tmax⁡=0T_{\max}=0Tmax​=0 is a consecutive partition

Proved
BurnInBatch.AgreeTmax.consecutive_optimal

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

batch-processingconsecutive-partitionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Consider nnn jobs on a single batch processing machine of capacity B≥1B\ge 1B≥1, all available at time 000, with processing times pip_ipi​ and due dates did_idi​, indexed so that

d1≤d2≤⋯≤dnandp1≤p2≤⋯≤pn.d_1\le d_2\le\dots\le d_n\quad\text{and}\quad p_1\le p_2\le\dots\le p_n .d1​≤d2​≤⋯≤dn​andp1​≤p2​≤⋯≤pn​.

Fix j≤nj\le nj≤n. If the jobs 1,…,j1,\dots,j1,…,j have a batch schedule with Tmax⁡=0T_{\max}=0Tmax​=0, then among all such schedules there is one of minimum makespan that is a consecutive partition: each batch is a set {i,i+1,…,k}\{i,i+1,\dots,k\}{i,i+1,…,k} of consecutively indexed jobs (of at most BBB jobs), and the batches are processed in increasing order of index.

This is the step by which the paper reduces 1/B/Tmax⁡1/B/T_{\max}1/B/Tmax​ with agreeable processing times and due dates to a consecutive partition problem, which Algorithm DP2 solves.

Formalization Note The paper's "jobs are indexed in increasing order of due dates" (p. 767) is taken together with nondecreasing processing times. Agreeable data (strict form, pi<pj⇒di≤djp_i<p_j\Rightarrow d_i\le d_jpi​<pj​⇒di​≤dj​) always admit such an indexing (sort by due date, then by processing time), and the pair implies agreeability. With ties in ddd broken against ppp the DP of the next statement is wrong, which is why both orders are assumed. Minimality is over all valid schedules of the first jjj jobs with Tmax⁡=0T_{\max}=0Tmax​=0.

Preamble
import Mathlib
import Definitions.Def_BurnInBatch_AgreeTmax_Model
Formal statement
namespace BurnInBatch.AgreeTmax

/-- Justification of Algorithm DP2 (p. 770, by reference to that of DP1, p. 768): with jobs
indexed so that due dates and processing times are both nondecreasing, if the jobs `1, …, j`
(`j ≤ n`) can be scheduled with `T_max = 0`, then among such schedules one of minimum makespan
is a consecutive partition: its batches are sets of consecutively indexed jobs, in increasing
order of index. -/
theorem consecutive_optimal {n B : ℕ} (hB : 0 < B) (p d : Fin n → ℕ)
    (hd : Monotone d) (hp : Monotone p) (j : ℕ) (hj : j ≤ n)
    (hfeas : ∃ S : List (Finset (Fin n)), IsValid B (jobsUpTo n j) S ∧ Tmax p d S = 0) :
    ∃ S : List (Finset (Fin n)), IsValid B (jobsUpTo n j) S ∧ Tmax p d S = 0 ∧
      IsConsecutive S ∧
      ∀ S' : List (Finset (Fin n)), IsValid B (jobsUpTo n j) S' → Tmax p d S' = 0 →
        makespan p S ≤ makespan p S' := by sorry

end BurnInBatch.AgreeTmax
Source
Lee, Uzsoy & Martin-Vega, Efficient Algorithms for Scheduling Semiconductor Burn-In Operations, Oper. Res. 40(4) (1992), p. 770, §3, justification of Algorithm DP2, by reference to the justification of Algorithm DP1, p. 768
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