Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4 — relative maximum-lateness error of BLS

Proved
BurnInBatch.ListSched.proposition_4

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

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

Let n>0n>0n>0 jobs have positive processing times pjp_jpj​ and nonnegative due dates djd_jdj​. Fix a positive batch capacity BBB, a positive number mmm of identical parallel machines, and any list containing each job once. Let LLL be the maximum lateness of BLS on that list, L∗L^*L∗ the minimum maximum lateness over all valid batch schedules, and dmax⁡d_{\max}dmax​ the largest due date. Then

L−L∗L∗+dmax⁡≤(B−1m)+dmax⁡L∗+dmax⁡.\frac{L-L^*}{L^*+d_{\max}} \le \left(B-\frac1m\right)+\frac{d_{\max}}{L^*+d_{\max}}.L∗+dmax​L−L∗​≤(B−m1​)+L∗+dmax​dmax​​.

The normalization accommodates an optimal maximum lateness that can be negative. This result bounds BLS's relative maximum-lateness error using the batch capacity, machine count, and maximum due date.

Formalization Note The proof's last inequality requires dj≥0d_j\ge0dj​≥0, a condition implicit in the paper's deadline setting but absent from its printed Proposition 4. Without it, the proposition can fail; for one job with p=4p=4p=4, d=−3d=-3d=−3, B=1B=1B=1, and m=2m=2m=2, its right side is negative while its left side is zero. Positive processing times and a nonempty instance ensure L∗+dmax⁡>0L^*+d_{\max}>0L∗+dmax​>0. The ratio has exactly the printed factor B−1/mB-1/mB−1/m.

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

/-- Proposition 4, p. 773: the relative maximum-lateness error of BLS.
The hypothesis `hd` (nonnegative due dates) is not printed in the proposition; the
proof's last step `d_max - d^k ≤ d_max` uses it, and without it the statement fails
(one job, `p = 4`, `d = -3`, `B = 1`, `m = 2`). -/
theorem proposition_4 {n : ℕ} (p d : Fin n → ℝ) (B m : ℕ)
    (l : List (Fin n)) (hn : 0 < n) (hB : 0 < B) (hm : 0 < m)
    (hp : ∀ j, 0 < p j) (hd : ∀ j, 0 ≤ d j)
    (hl : ListsJobs Finset.univ l) :
    (blsLateness p d B m hm l Finset.univ - LStar p d B m Finset.univ) /
        (LStar p d B m Finset.univ + maxDue d hn) ≤
      ((B : ℝ) - 1 / (m : ℝ)) +
        maxDue d hn / (LStar p d B m Finset.univ + maxDue d hn) := 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, Proposition 4; 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