Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.8 — the optimal makespan of Q | pmtn | Cmax is the bound w of (5.5)

Proved
SchedulingAlgorithms.uniform_pmtn_optimal_makespan

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. With 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​, let

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​​}.

Then there is a feasible preemptive schedule whose makespan equals www and which is optimal: its makespan is at most the makespan of every feasible preemptive schedule. Equivalently, the optimal value of Q∣pmtn∣Cmax⁡Q\mid pmtn\mid C_{\max}Q∣pmtn∣Cmax​ is exactly www.

This is Theorem 5.8 stated as a fact about schedules rather than about the level algorithm: the book proves the theorem by showing that the schedule the level algorithm builds — jobs of highest remaining level always assigned to the fastest free machines, ties processed jointly by time-sharing — finishes at time www, and that www is a lower bound (5.5). The result contains McNaughton's rule for identical machines as the case s1=⋯=sm=1s_1=\dots=s_m=1s1​=⋯=sm​=1, where www reduces to max⁡{max⁡ipi, Pn/m}\max\{\max_i p_i,\,P_n/m\}max{maxi​pi​,Pn​/m}.

Formalization Note The statement asserts the existence of an optimal schedule and pins its value to www; it does not assert that the level algorithm produces it, since the algorithm is not part of the statement. Feasibility, makespan and www are as in the definition file. The sorted orders, the positivity of speeds and requirements, and n≥mn\ge mn≥m are the section's standing assumptions on p. 124; the normalisation s1=1s_1=1s1​=1 is not assumed, as the statement is invariant under scaling all speeds.

Preamble
import Definitions.Def_SchedulingAlgorithms_ParallelMachines
Formal statement
namespace SchedulingAlgorithms
theorem uniform_pmtn_optimal_makespan {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, IsFeasible s p S ∧ makespan S = levelBound s p ∧
      ∀ S' : PreemptiveSchedule n m, IsFeasible s p S' → makespan S ≤ 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 p. 127 (PDF p. 139), Theorem 5.8: "Algorithm level constructs an optimal schedule for problem Q | pmtn | Cmax", whose proof (pp. 127-128) shows that the schedule constructed has length exactly the lower bound w of (5.5), printed p. 125 (PDF p. 137).
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