Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8.3.4 — LP rounding schedules unrelated machines within twice the optimal makespan

Proved
MatousekLP.Scheduling.lst_two_approximation

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

approximation-algorithmslinear-programminglp-roundingp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1scheduling

Let nnn jobs be scheduled on mmm machines, job jjj taking time dij>0d_{ij} > 0dij​>0 on machine iii, and let toptt_{\mathrm{opt}}topt​ be the makespan of an optimal schedule σopt\sigma_{\mathrm{opt}}σopt​. For T∈RT \in \mathbb{R}T∈R let t∗(T)t^*(T)t∗(T) be the optimal value of the linear program LPR(T)\mathrm{LPR}(T)LPR(T), with t∗(T)=∞t^*(T) = \inftyt∗(T)=∞ when it is infeasible. Let T∗T^*T∗ minimize t∗(T)+Tt^*(T) + Tt∗(T)+T over all real TTT, and let (t∗,x∗)(t^*, x^*)(t∗,x∗) be an optimal solution of LPR(T∗)\mathrm{LPR}(T^*)LPR(T∗) satisfying Assumption 8.3.1 (for instance a basic optimal solution).

Then the rounding of Lemma 8.3.3 applied to x∗x^*x∗ yields a schedule σ\sigmaσ that assigns each job jjj to a machine with xσ(j) j∗>0x^*_{\sigma(j)\,j} > 0xσ(j)j∗​>0 and whose makespan is at most twice the optimum:

max⁡i∑j: σ(j)=idij  ≤  2 topt.\max_{i} \sum_{j:\ \sigma(j) = i} d_{ij} \;\le\; 2\, t_{\mathrm{opt}} .imax​j: σ(j)=i∑​dij​≤2topt​.

This is the 2-approximation algorithm of Lenstra, Shmoys and Tardos (1990) for minimizing the makespan on unrelated parallel machines, an NP-hard problem.

Formalization Note "The algorithm in the proof of Lemma 8.3.3 computes a schedule" is formalized by the property of that schedule: it uses only edges of the support graph of x∗x^*x∗ (xσ(j)j∗>0x^*_{\sigma(j) j} > 0xσ(j)j∗​>0). Without this constraint the conclusion would be trivial, since σopt\sigma_{\mathrm{opt}}σopt​ itself has makespan topt≤2toptt_{\mathrm{opt}} \le 2 t_{\mathrm{opt}}topt​≤2topt​. Minimality of T∗T^*T∗ is the hypothesis t∗+T∗≤t+Tt^* + T^* \le t + Tt∗+T∗≤t+T for every real TTT and every optimal solution (t,x)(t, x)(t,x) of LPR(T)\mathrm{LPR}(T)LPR(T). The running time of the algorithm is not formalized. Machines are Fin m, jobs Fin n.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Scheduling_Schedule
import Definitions.Def_MatousekLP_Scheduling_LPRelaxation
Formal statement
namespace MatousekLP.Scheduling

/-- Theorem 8.3.4 (Matoušek–Gärtner, p. 155; Lenstra–Shmoys–Tardos). Let `T*` minimize
`t*(T) + T` over all real `T` (with `t*(T) = ∞` when `LPR(T)` is infeasible), and let
`(t*, x*)` be an optimal solution of `LPR(T*)` satisfying Assumption 8.3.1. Then the
rounding of Lemma 8.3.3 yields a schedule `σ` that assigns every job `j` along an edge of
the support graph (`x*_{σ(j) j} > 0`) and has makespan at most `2 t_opt`, where `t_opt`
is the makespan of an optimal schedule `σopt`. -/
theorem lst_two_approximation {m n : ℕ} (d : Matrix (Fin m) (Fin n) ℝ)
    (hd : ∀ i j, 0 < d i j) (σopt : Fin n → Fin m) (hσopt : IsOptimalSchedule d σopt)
    (Tstar tstar : ℝ) (xstar : Matrix (Fin m) (Fin n) ℝ)
    (hopt : LPROptimal d Tstar tstar xstar) (hA : Assumption831 d Tstar xstar)
    (hmin : ∀ (T t : ℝ) (x : Matrix (Fin m) (Fin n) ℝ),
      LPROptimal d T t x → tstar + Tstar ≤ t + T) :
    ∃ σ : Fin n → Fin m, (∀ j, 0 < xstar (σ j) j) ∧
      makespan d σ ≤ 2 * makespan d σopt := by sorry

end MatousekLP.Scheduling
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 155, Theorem 8.3.4
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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