Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5.8) — jobs fit into an interval of length T iff sum_{i in A} p_i ≤ T h(A) for every set A

Proved
SchedulingAlgorithms.uniform_pmtn_feasible_iff

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

combinatoricsoperations-researchoptimizationscheduling

Consider nnn jobs with positive processing requirements sorted as p1≥⋯≥pnp_1\ge\dots\ge p_np1​≥⋯≥pn​ and m≥1m\ge 1m≥1 uniform machines with positive speeds sorted as s1≥⋯≥sms_1\ge\dots\ge s_ms1​≥⋯≥sm​, and a length T≥0T\ge 0T≥0. For a set AAA of jobs put

h(A)  =  {S∣A∣if ∣A∣≤m,Smotherwise,Sj=∑i≤jsi,h(A)\;=\;\begin{cases}S_{|A|} & \text{if } |A|\le m,\\ S_m & \text{otherwise,}\end{cases} \qquad S_j=\sum_{i\le j}s_i ,h(A)={S∣A∣​Sm​​if ∣A∣≤m,otherwise,​Sj​=i≤j∑​si​,

the largest combined speed that ∣A∣|A|∣A∣ jobs can use at one instant. Then the jobs can be scheduled preemptively within the interval [0,T][0,T][0,T] — some feasible preemptive schedule has makespan at most TTT — if and only if

∑i∈Api  ≤  T h(A)for all A⊆{1,…,n}.(5.8)\sum_{i\in A}p_i\;\le\;T\,h(A)\qquad\text{for all } A\subseteq\{1,\dots,n\}. \tag{5.8}i∈A∑​pi​≤Th(A)for all A⊆{1,…,n}.(5.8)

This is condition (5.8) of Section 5.1.2, the necessary and sufficient condition the book derives from the level algorithm and then uses in Theorem 5.9 to reduce Q∣pmtn;ri∣Lmax⁡Q\mid pmtn; r_i\mid L_{\max}Q∣pmtn;ri​∣Lmax​ to a flow problem. Necessity is the counting argument behind (5.5) applied to an arbitrary set of jobs; sufficiency is that (5.8) for the sets {1,…,j}\{1,\dots,j\}{1,…,j} says exactly that the bound www of (5.5) is at most TTT, and the level algorithm then finishes by time www.

Formalization Note The condition is quantified over all subsets AAA, as printed, including A=∅A=\emptysetA=∅ (where it reads 0≤00\le 00≤0) and sets with ∣A∣>m|A|>m∣A∣>m. Feasibility and makespan are as in the definition file; "within an interval of length TTT" is the requirement that every piece stops by time TTT, which with T≥0T\ge 0T≥0 is the book's meaning. The sorted orders are the section's standing assumptions and are kept, although the displayed condition is symmetric in the jobs. No relation between nnn and mmm is assumed, since the book states (5.8) for arbitrary nnn through the case distinction in hhh.

Preamble
import Definitions.Def_SchedulingAlgorithms_ParallelMachines
Formal statement
namespace SchedulingAlgorithms
theorem uniform_pmtn_feasible_iff {n m : ℕ} (hm : 0 < m)
    (s : Fin m → ℝ) (hs : ∀ j, 0 < s j) (hs' : Antitone s)
    (p : Fin n → ℝ) (hp : ∀ i, 0 < p i) (hp' : Antitone p)
    (T : ℝ) (hT : 0 ≤ T) :
    (∃ S : PreemptiveSchedule n m, IsFeasible s p S ∧ makespan S ≤ T) ↔
      ∀ A : Finset (Fin n), ∑ i ∈ A, p i ≤ T * speedCapacity s A := 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. 128-129 (PDF pp. 140-141), condition (5.8): "jobs 1, ..., n with processing requirements p_1, ..., p_n can be scheduled within an interval of length T if and only if sum_{i in A} p_i ≤ T h(A) for all A ⊆ {1, ..., n}", with h(A) = S_|A| if |A| ≤ m and S_m otherwise, under the section's standing assumptions s_1 ≥ ... ≥ s_m and p_1 ≥ ... ≥ p_n.
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