Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

P | pmtn | Cmax — the bound LB = max{max_i p_i, (sum_i p_i)/m} is attained

Proved
SchedulingAlgorithms.identical_pmtn_makespan

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

combinatoricsoperations-researchoptimizationscheduling

Consider n≥1n\ge 1n≥1 jobs with positive processing times p1,…,pnp_1,\dots,p_np1​,…,pn​ to be processed preemptively on m≥1m\ge 1m≥1 identical machines (all speeds equal to 111). Let

LB  :=  max⁡{max⁡ipi, 1m∑i=1npi}.LB \;:=\; \max\Bigl\{\max_i p_i,\ \frac{1}{m}\sum_{i=1}^{n}p_i\Bigr\} .LB:=max{imax​pi​, m1​i=1∑n​pi​}.

Then (i) every feasible preemptive schedule has makespan at least LBLBLB, and (ii) some feasible preemptive schedule has makespan exactly LBLBLB. In other words, LBLBLB is the optimal value of P∣pmtn∣Cmax⁡P\mid pmtn\mid C_{\max}P∣pmtn∣Cmax​.

Part (i) is the sentence "A lower bound for this problem is LB" on p. 108: no job can finish before its own processing time has elapsed, and the total work cannot exceed mmm times the makespan. Part (ii) is the construction on the same page, McNaughton's wrap-around rule: fill the machines one after another with the jobs in any order, cutting a job in two whenever the current machine reaches time LBLBLB and continuing the remainder on the next machine from time 000. Because pi≤LBp_i\le LBpi​≤LB, the two parts of a cut job never overlap in time, which is what makes the resulting schedule feasible.

Formalization Note A feasible schedule is a finite list of pieces on which no machine and no job is double-booked and every job receives its full processing time; the makespan is the largest stop time. No sorting of the jobs is assumed, since the rule works for any order. The hypothesis n≥1n\ge 1n≥1 is needed for max⁡ipi\max_i p_imaxi​pi​ to be defined and is what the definition of LBLBLB takes as an argument; m≥1m\ge 1m≥1 is the book's standing assumption that there are machines at all.

Preamble
import Definitions.Def_SchedulingAlgorithms_ParallelMachines
Formal statement
namespace SchedulingAlgorithms
theorem identical_pmtn_makespan {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
    (p : Fin n → ℝ) (hp : ∀ i, 0 < p i) :
    (∀ S : PreemptiveSchedule n m, IsFeasible (fun _ => 1) p S →
        mcNaughtonBound hn p m ≤ makespan S) ∧
      ∃ S : PreemptiveSchedule n m, IsFeasible (fun _ => 1) p S ∧
        makespan S = mcNaughtonBound hn p m := 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.1, printed p. 108 (PDF p. 120), "P | pmtn | Cmax": "A lower bound for this problem is LB := max{max_i p_i, (sum_{i=1}^n p_i)/m}. A schedule meeting this bound can be constructed in O(n) time: fill the machines successively, scheduling the jobs in any order and splitting jobs into two parts whenever the above time bound is met. Schedule the second part of a preempted job on the next machine at zero time."
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