Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5 — on-time batches can contain consecutive jobs

Proved
BurnInBatch.TardyJobs.lemma_5

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

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

Consider the equal-processing-time batch problem with capacity B≥1B\ge1B≥1 and jobs indexed so that release times and due dates are both nondecreasing. There is an optimal complete schedule in which every batch whose jobs all finish on time consists of consecutive indices. If such a batch has kkk jobs and first index aaa, its set of jobs is

{a,a+1,…,a+k−1}.\{a,a+1,\ldots,a+k-1\}.{a,a+1,…,a+k−1}.

This existence claim supplies the consecutive-last-batch structure used by DP3 without narrowing the optimization problem's feasible schedules.

Formalization Note The paper states agreeable releases and due dates and then fixes due-date index order for this section. Both sequences are required to be nondecreasing so a batch's last index has its latest release; tied due dates are ordered by release time.

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

/-- Lemma 5, p. 770: in an optimum, every entirely on-time batch
consists of consecutive job indices. -/
theorem lemma_5 {n : ℕ} (B p : ℕ) (r d : Fin n → ℕ)
    (hB : 0 < B) (hd : Monotone d) (hr : Monotone r) :
    ∃ S : List (Finset (Fin n)),
      Optimal B (equalTime p) r d S ∧
      ∀ P ∈ S,
        (∀ j ∈ P, jobCompletion (equalTime p) r S j ≤ d j) → Consecutive P := 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 5
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