Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 4 — sub-instance lateness lower bound

Proved
BurnInBatch.ListSched.lateness_lower_bound

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

batch-processingmaximum-latenessp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let JJJ be a nonempty subset of the jobs, with positive processing times, batch capacity B>0B>0B>0, and m>0m>0m>0 parallel machines. Let L∗(J)L^*(J)L∗(J) be the least maximum lateness achievable for JJJ, let Cmax⁡∗(J)C_{\max}^*(J)Cmax∗​(J) be its least makespan, and let dmax⁡d_{\max}dmax​ be the greatest due date among all jobs. Then

L∗(J)≥Cmax⁡∗(J)−dmax⁡.L^*(J)\ge C_{\max}^*(J)-d_{\max}.L∗(J)≥Cmax∗​(J)−dmax​.

The estimate connects a lateness optimum on the prefix sub-instance with the makespan bound of Proposition 1.

Formalization Note The full instance has at least one job so its maximum due date is defined. This item needs no sign condition on due dates; the goal theorem separately assumes nonnegative due dates.

Preamble
import Mathlib
import Definitions.Def_BurnInBatch_ListSched_Model
Formal statement
namespace BurnInBatch.ListSched

/-- Proof of Proposition 4, p. 773: the lateness optimum on a sub-instance
is at least its makespan optimum minus the full instance's largest due date. -/
theorem lateness_lower_bound {n : ℕ} (p d : Fin n → ℝ) (B m : ℕ)
    (J : Finset (Fin n)) (hn : 0 < n) (hJ : J.Nonempty)
    (hB : 0 < B) (hm : 0 < m) (hp : ∀ j, 0 < p j) :
    CmaxStar p B m J - maxDue d hn ≤ LStar p d B m J := by sorry

end BurnInBatch.ListSched
Source
Lee, Uzsoy & Martin-Vega, Efficient Algorithms for Scheduling Semiconductor Burn-In Operations, Oper. Res. 40(4) (1992), p. 773, proof of Proposition 4, display “L*(S_k) ≥ C_max*(S_k) − d_max”; https://doi.org/10.1287/opre.40.4.764
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