Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2.2, p. 313 — C*max ≥ C: every machine load and job length is at most the makespan

Proved
SchedSurvey.OPmtn.lower_bound

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

lower-boundmakespanopen-shopp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1preemptionscheduling

Let P=(pij)P=(p_{ij})P=(pij​) be an m×nm\times nm×n matrix of processing times pij≥0p_{ij}\ge 0pij​≥0, rows indexed by the machines MiM_iMi​ and columns by the jobs JjJ_jJj​ of an open shop with preemption allowed. Let σ\sigmaσ be a feasible preemptive schedule for PPP in which every piece ends by time T≥0T\ge 0T≥0. Then

∑jpij≤Tfor every machine Mi,∑ipij≤Tfor every job Jj.\sum_{j} p_{ij}\le T\quad\text{for every machine } M_i,\qquad \sum_{i} p_{ij}\le T\quad\text{for every job } J_j.j∑​pij​≤Tfor every machine Mi​,i∑​pij​≤Tfor every job Jj​.

Equivalently, Cmax⁡∗≥C=max⁡{max⁡j∑ipij,max⁡i∑jpij}C^*_{\max}\ge C=\max\{\max_j\sum_i p_{ij},\max_i\sum_j p_{ij}\}Cmax∗​≥C=max{maxj​∑i​pij​,maxi​∑j​pij​}. This is the lower half of the optimality theorem for O∣pmtn∣Cmax⁡O|pmtn|C_{\max}O∣pmtn∣Cmax​: no machine can finish its load, and no job its total processing, faster than in the given amount of time.

Formalization Note Machines M1,…,MmM_1,\dots,M_mM1​,…,Mm​ and jobs J1,…,JnJ_1,\dots,J_nJ1​,…,Jn​ are indexed by Fin m and Fin n, which are 0-based: MiM_iMi​ is index i−1i-1i−1 and JjJ_jJj​ is index j−1j-1j−1. The hypothesis T≥0T\ge 0T≥0 is needed only for P=0P=0P=0, where the empty schedule completes by every TTT, including negative ones.

Preamble
import Mathlib
import Definitions.Def_SchedSurvey_OPmtn_Model
Formal statement
namespace SchedSurvey.OPmtn

/-- §5.2.2, p. 313: "We clearly have C*max ≥ C." Every feasible preemptive open-shop schedule
that completes by `T ≥ 0` has every machine load and every job length at most `T`. -/
theorem lower_bound {m n : ℕ} (P : Fin m → Fin n → ℝ) (hP : ∀ i j, 0 ≤ P i j)
    (S : List (Piece m n)) (hS : IsFeasible P S) (T : ℝ) (hT : 0 ≤ T)
    (hST : CompletesBy S T) :
    (∀ i, rowSum P i ≤ T) ∧ ∀ j, colSum P j ≤ T := by sorry

end SchedSurvey.OPmtn
Source
Graham, Lawler, Lenstra, Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math. 5 (1979), p. 313, §5.2.2, "We clearly have C*max ≥ C."
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