Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 — an optimal schedule has on-time batches first in batch-EDD order

Proved
BurnInBatch.TardyJobs.lemma_4

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

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

Consider one batch machine of capacity B≥1B\ge1B≥1, common job processing time ppp, releases rjr_jrj​, and due dates djd_jdj​. Suppose ri<rjr_i<r_jri​<rj​ implies di≤djd_i\le d_jdi​≤dj​. There is an optimal complete schedule consisting of an initial list AAA of batches whose every job is on time, followed by a list TTT of batches whose every job is tardy; the batches in AAA are in batch-EDD order. Thus, with S=A+ ⁣+TS=A\mathbin{+\!+}TS=A++T,

U(S)=U∗,(j∈A⇒Cj(S)≤dj),(j∈T⇒dj<Cj(S)).U(S)=U^*,\qquad (j\in A\Rightarrow C_j(S)\le d_j),\qquad (j\in T\Rightarrow d_j<C_j(S)).U(S)=U∗,(j∈A⇒Cj​(S)≤dj​),(j∈T⇒dj​<Cj​(S)).

This structural result lets subsequent statements place all tardy jobs after the on-time part while retaining the global optimum over complete schedules.

Formalization Note The strict-release form of agreeability permits unequal due dates when releases tie. AAA and TTT are lists of batches, and Optimal still ranges over every valid complete schedule.

Preamble
import Mathlib
import Definitions.Def_BurnInBatch_TardyJobs_Model
Formal statement
namespace BurnInBatch.TardyJobs

/-- Lemma 4, p. 770: an optimal schedule can put every on-time batch first,
with those batches in batch-EDD order, and all tardy jobs afterward. -/
theorem lemma_4 {n : ℕ} (B p : ℕ) (r d : Fin n → ℕ)
    (hB : 0 < B) (hagree : ∀ i j : Fin n, r i < r j → d i ≤ d j) :
    ∃ A T : List (Finset (Fin n)),
      Optimal B (equalTime p) r d (A ++ T) ∧
      (∀ P ∈ A, ∀ j ∈ P, jobCompletion (equalTime p) r (A ++ T) j ≤ d j) ∧
      (∀ P ∈ T, ∀ j ∈ P, d j < jobCompletion (equalTime p) r (A ++ T) j) ∧
      BatchEDD d A := by sorry

end BurnInBatch.TardyJobs
Source
Lee, Uzsoy & Martin-Vega, Efficient Algorithms for Scheduling Semiconductor Burn-In Operations, Oper. Res. 40(4) (1992), p. 770, Lemma 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