Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5.5) — the bound w is a lower bound for Q | pmtn | Cmax

Proved
SchedulingAlgorithms.uniform_pmtn_lower_bound

by naimengye · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsoperations-researchoptimizationscheduling

Consider nnn jobs with positive processing requirements sorted as p1≥p2≥⋯≥pnp_1\ge p_2\ge\dots\ge p_np1​≥p2​≥⋯≥pn​, to be processed preemptively on mmm uniform machines with positive speeds sorted as s1≥s2≥⋯≥sms_1\ge s_2\ge\dots\ge s_ms1​≥s2​≥⋯≥sm​, where 1≤m≤n1\le m\le n1≤m≤n. Let Pj=∑i≤jpiP_j=\sum_{i\le j}p_iPj​=∑i≤j​pi​ and Sj=∑i≤jsiS_j=\sum_{i\le j}s_iSj​=∑i≤j​si​. Then every feasible preemptive schedule has makespan at least

w  =  max⁡{max⁡j=1m−1PjSj, PnSm}.w \;=\; \max\Bigl\{\max_{j=1}^{m-1}\frac{P_j}{S_j},\ \frac{P_n}{S_m}\Bigr\} .w=max{j=1maxm−1​Sj​Pj​​, Sm​Pn​​}.

Here a feasible schedule is a finite list of pieces (job, machine, start, stop) in which no two pieces on one machine overlap, no two pieces of one job overlap, and each job iii receives total work ∑sj (stop−start)=pi\sum s_{j}\,(\text{stop}-\text{start})=p_i∑sj​(stop−start)=pi​ over its pieces; the makespan is the largest stop time.

This is the bound (5.5) of Section 5.1.2. The term Pn/SmP_n/S_mPn​/Sm​ says that all the work has to fit into the total capacity SmTS_m TSm​T of the mmm machines during [0,T][0,T][0,T]. The term Pj/SjP_j/S_jPj​/Sj​ says that the jjj longest jobs, which can occupy at most jjj machines at any instant, cannot be processed faster than at the combined rate of the jjj fastest machines.

Formalization Note The sorted orders are hypotheses, Antitone p and Antitone s, because the formula names the jjj first jobs and machines. Positivity of the speeds makes every SjS_jSj​ with j≥1j\ge 1j≥1 positive, so no division in www is a division by zero; the book's normalisation s1=1s_1=1s1​=1 is not assumed, since the bound is invariant under scaling all speeds and the book uses the normalisation only for a running-time estimate. The book's convention that a job is processed by at most one machine at a time is part of feasibility and is exactly what the Pj/SjP_j/S_jPj​/Sj​ terms rely on.

Preamble
import Definitions.Def_SchedulingAlgorithms_ParallelMachines
Formal statement
namespace SchedulingAlgorithms
theorem uniform_pmtn_lower_bound {n m : ℕ} (hm : 0 < m) (hmn : m ≤ n)
    (s : Fin m → ℝ) (hs : ∀ j, 0 < s j) (hs' : Antitone s)
    (p : Fin n → ℝ) (hp : ∀ i, 0 < p i) (hp' : Antitone p)
    (S : PreemptiveSchedule n m) (hS : IsFeasible s p S) :
    levelBound s p ≤ makespan S := by sorry
end SchedulingAlgorithms
Source
Peter Brucker, Scheduling Algorithms, 5th ed., Springer 2007, https://doi.org/10.1007/978-3-540-69516-5 — Section 5.1.2, printed pp. 124-125 (PDF pp. 136-137), the bound (5.5): "w := max{max_{j=1}^{m-1} P_j/S_j, P_n/S_m} (5.5) is a lower bound for the Cmax-values", under the section's standing assumptions 1 = s_1 ≥ s_2 ≥ ... ≥ s_m, p_1 ≥ p_2 ≥ ... ≥ p_n and n ≥ m.
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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