Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2.1, p. 312 — every feasible O2 schedule has Cmax ≥ max{T₁, T₂, maxⱼ(aⱼ + bⱼ)}

Proved
SchedSurvey.O2.makespan_lower_bound

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

makespanopen-shopp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Consider the two-machine open shop with nonnegative processing times aja_jaj​ on M1M_1M1​ and bjb_jbj​ on M2M_2M2​, and let T1=∑jajT_1 = \sum_j a_jT1​=∑j​aj​, T2=∑jbjT_2 = \sum_j b_jT2​=∑j​bj​. For every feasible schedule,

Cmax⁡≥max⁡{T1, T2, max⁡j (aj+bj)}.C_{\max} \ge \max\Big\{T_1,\ T_2,\ \max_j\,(a_j + b_j)\Big\}.Cmax​≥max{T1​, T2​, jmax​(aj​+bj​)}.

Equivalently: if a feasible schedule completes every operation by time T≥0T \ge 0T≥0, then T1≤TT_1 \le TT1​≤T, T2≤TT_2 \le TT2​≤T, and aj+bj≤Ta_j + b_j \le Taj​+bj​≤T for every job jjj.

The three terms are the loads of the two machines and the longest job: a machine processes one job at a time, and a job is on one machine at a time. This lower bound is what makes the survey's constructed schedules optimal.

Formalization Note Cmax⁡≥XC_{\max} \ge XCmax​≥X is stated through thresholds: every TTT with Cmax⁡≤TC_{\max} \le TCmax​≤T satisfies X≤TX \le TX≤T. The hypothesis T≥0T \ge 0T≥0 matters only for n=0n = 0n=0, where Cmax⁡=0C_{\max} = 0Cmax​=0 and the bound reads 0≤T0 \le T0≤T.

Preamble
import Mathlib
import Definitions.Def_SchedSurvey_O2_Model
Formal statement
namespace SchedSurvey.O2

/-- §5.2.1, p. 312: every feasible schedule has `Cmax ≥ max{T₁, T₂, maxⱼ(aⱼ + bⱼ)}`, stated as: if a
feasible schedule completes by `T ≥ 0`, then `T₁ ≤ T`, `T₂ ≤ T` and `aⱼ + bⱼ ≤ T` for every job. -/
theorem makespan_lower_bound {n : ℕ} (a b : Fin n → ℝ) (ha : ∀ j, 0 ≤ a j)
    (hb : ∀ j, 0 ≤ b j) (S : Schedule n) (hS : IsFeasible a b S) (T : ℝ) (hT : 0 ≤ T)
    (hST : CompletesBy a b S T) :
    T₁ a ≤ T ∧ T₂ b ≤ T ∧ ∀ j, a j + b j ≤ T := by sorry

end SchedSurvey.O2
Source
Graham, Lawler, Lenstra, Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math. 5 (1979), p. 312, §5.2.1, "For any feasible schedule we obviously have that Cmax ≥ max{T₁, T₂, maxⱼ{aⱼ + bⱼ}}"
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