Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 5 — a schedule with makespan at most d is a feasible solution of (LP) with d_i = t = d

Proved
UnrelatedSched.TwoApprox.yes_instance_lp_feasible

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

linear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let P=(pij)∈Nm×nP=(p_{ij})\in\mathbb N^{m\times n}P=(pij​)∈Nm×n and d∈Rd\in\mathbb Rd∈R, and let σ\sigmaσ be a schedule with makespan at most ddd. Then its 0-1 matrix, xij=1x_{ij}=1xij​=1 if job jjj is assigned to machine iii and 000 otherwise, is a feasible solution of the linear program (LP) with

d1=⋯=dm=t=d.d_1=\dots=d_m=t=d .d1​=⋯=dm​=t=d.

This is the 'yes' direction of the 2-relaxed decision procedure: if (LP) has no feasible point, no schedule meets the deadline ddd.

Formalization Note Feasibility includes xij=0x_{ij}=0xij​=0 whenever pij>dp_{ij}>dpij​>d, which holds because each processing time of an assigned job is at most its machine's load.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Scheduling_Schedule
import Definitions.Def_UnrelatedSched_TwoApprox_DeadlineLP
Formal statement
namespace UnrelatedSched.TwoApprox

open MatousekLP.Scheduling

/-- §3, p. 5: the 0-1 matrix of a schedule with makespan at most `d` is feasible for (LP) with
`d_1 = ⋯ = d_m = t = d`. -/
theorem yes_instance_lp_feasible {m n : ℕ} (P : Matrix (Fin m) (Fin n) ℕ) (d : ℝ)
    (σ : Fin n → Fin m) (hσ : makespan (realTimes P) σ ≤ d) :
    assignmentMatrix σ ∈ LPPolytope P (fun _ => d) d := by sorry

end UnrelatedSched.TwoApprox
Source
Lenstra, Shmoys, Tardos, Approximation algorithms for scheduling unrelated parallel machines, CWI Report OS-R8714 (1987), p. 5, §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