Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 772 — Graham's LPT bound 4/3−1/(3m)4/3 - 1/(3m)4/3−1/(3m) for P//Cmax⁡P//C_{\max}P//Cmax​, as quoted

Proved
BurnInBatch.BatchLPT.graham_lpt_bound

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

approximationlist-schedulinglptp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

This is Graham's theorem on the LPT rule (R. L. Graham, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math. 17 (1969)), quoted by Lee, Uzsoy and Martin-Vega.

Let q0≥q1≥⋯≥qM−1≥0q_0 \ge q_1 \ge \dots \ge q_{M-1} \ge 0q0​≥q1​≥⋯≥qM−1​≥0 be the processing times of MMM jobs listed in nonincreasing order, and m≥1m \ge 1m≥1 the number of identical machines. List scheduling takes the jobs in this order and assigns each to a machine of currently least load; write CLPTC_{\mathrm{LPT}}CLPT​ for the resulting makespan (largest machine load). Let C∗C^*C∗ be the optimal makespan, the minimum of the largest machine load over all assignments of the MMM jobs to the mmm machines. Then

CLPT≤(43−13m)C∗.C_{\mathrm{LPT}} \le \left(\frac43 - \frac1{3m}\right) C^* .CLPT​≤(34​−3m1​)C∗.

In the paper this is the bound transferred to batch machines through Proposition 2 to give Proposition 3.

Formalization Note. Stated purely on the published definitions listMakespan M m q and optMakespan M m q, which only read q0,…,qM−1q_0, \dots, q_{M-1}q0​,…,qM−1​. Ties among least-loaded machines go to the lowest index (published rule); the bound holds for any tie rule. Nonnegative (rather than positive) times are allowed; zero-length jobs change nothing.

Preamble
import Mathlib
import Definitions.Def_NumStochOpt_ListScheduling_ListSchedule
import Definitions.Def_NumStochOpt_ListScheduling_Makespan
Formal statement
namespace BurnInBatch.BatchLPT

open NumStochOpt.ListScheduling

theorem graham_lpt_bound {M m : ℕ} (hm : 0 < m) (q : ℕ → ℝ)
    (hq_nonneg : ∀ k, k < M → 0 ≤ q k)
    (hq_noninc : ∀ k k', k ≤ k' → k' < M → q k' ≤ q k) :
    listMakespan M m q ≤ (4 / 3 - 1 / (3 * (m : ℝ))) * optMakespan M m q := by sorry

end BurnInBatch.BatchLPT
Source
Lee, Uzsoy & Martin-Vega, Efficient Algorithms for Scheduling Semiconductor Burn-In Operations, Oper. Res. 40(4) (1992), p. 772, §5 ("Graham has shown that for the P//C_max problem, this algorithm has a worst case error bound of (4/3 − 1/3m)"); quoted from R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM J. Appl. Math. 17 (1969) 416–429
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