Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 6 — long plus short assignments use at most (1+ε)d(1+\varepsilon)d(1+ε)d on each machine

Proved
UnrelatedSched.FixedMachines.combined_load_le

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

approximation-algorithmsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let P=(pij)P=(p_{ij})P=(pij​) be an m×nm\times nm×n matrix of positive integer processing times, d≥0d\ge 0d≥0 an integer and ε>0\varepsilon>0ε>0. Let LLL be a partial schedule of long assignments, with long load tit_iti​ on machine iii, and let σ\sigmaσ be a schedule that agrees with LLL on every job LLL assigns. Suppose that for every machine iii the jobs left unassigned by LLL that σ\sigmaσ puts on iii take total time at most d−ti+εdd-t_i+\varepsilon dd−ti​+εd. Then for every machine iii

loadi(σ)≤ti+d−ti+εd=(1+ε) d.\mathrm{load}_i(\sigma) \le t_i + d - t_i + \varepsilon d = (1+\varepsilon)\,d .loadi​(σ)≤ti​+d−ti​+εd=(1+ε)d.

This is the step of the proof of Theorem 3 that combines the rounded schedule of short assignments with the schedule of long assignments.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Scheduling_Schedule
import Definitions.Def_UnrelatedSched_FixedMachines_LongAssignment
Formal statement
namespace UnrelatedSched.FixedMachines

open MatousekLP.Scheduling

/-- §3, p. 6: if the schedule `σ` agrees with the schedule of long assignments `L` on the long
jobs and the short assignments take at most `d - t_i + ε d` on every machine `i`, then every
machine `i` is busy for at most `t_i + d - t_i + ε d = (1 + ε) d`. -/
theorem combined_load_le {m n : ℕ} (P : Matrix (Fin m) (Fin n) ℕ)
    (hP : ∀ i j, 0 < P i j) (ε : ℝ) (hε : 0 < ε) (d : ℕ) (L : Fin n → Option (Fin m))
    (σ : Fin n → Fin m) (hfollow : ∀ j i, L j = some i → σ j = i)
    (hshort : ∀ i, shortLoad P L σ i ≤ (d : ℝ) - longLoad P L i + ε * (d : ℝ)) :
    ∀ i, load (fun i j => (P i j : ℝ)) σ i ≤ (1 + ε) * (d : ℝ) := by sorry

end UnrelatedSched.FixedMachines
Source
Lenstra, Shmoys, Tardos, Approximation algorithms for scheduling unrelated parallel machines, CWI Report OS-R8714 (1987), p. 6, Section 3, proof of Theorem 3
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