Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

COROLLARY 1, p. 344 — some optimum schedule executes before T_N exactly the tasks with deadline ≤ β

Proved
GTWSched.MaxDisc.corollary_1

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

deadlinesnormal-formp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1release-timesschedulingsingle-machine

Let NNN tasks have lengths li≥0l_i \ge 0li​≥0, release times ri≥0r_i \ge 0ri​≥0 and deadlines did_idi​ in special form for α≥0\alpha \ge 0α≥0, and let TnT_nTn​ be a task of maximum deadline. If a feasible schedule exists, then there are an optimum schedule and a real number β≥0\beta \ge 0β≥0 such that for every task Ti≠TnT_i \ne T_nTi​=Tn​,

Ti is executed before Tn  ⟺  di≤β.T_i \text{ is executed before } T_n \iff d_i \le \beta.Ti​ is executed before Tn​⟺di​≤β.

This is the form of Theorem 4 on which the paper's algorithm is built: the set of tasks before the maximum-deadline task is a deadline threshold set.

Formalization Note. The paper says "the set of tasks executed before TNT_NTN​ is exactly the set of all tasks with deadline β\betaβ or less". The set is read as excluding TNT_NTN​ itself: in the proof β=t+α\beta = t + \alphaβ=t+α with ttt the start of TNT_NTN​, and dN≤t+αd_N \le t + \alphadN​≤t+α may hold, in which case TNT_NTN​ would belong to the set of tasks with deadline at most β\betaβ although it is not executed before itself. This is the only reading under which the corollary holds.

Preamble
import Mathlib
import Definitions.Def_GTWSched_MaxDisc_Model
Formal statement
namespace GTWSched.MaxDisc

theorem corollary_1 {N : ℕ} (r d l : Fin N → ℝ) (α : ℝ) (hα : 0 ≤ α)
    (hr : ∀ i, 0 ≤ r i) (hl : ∀ i, 0 ≤ l i) (hsf : SpecialForm r d l α)
    (n : Fin N) (hn : ∀ i, d i ≤ d n)
    (hfeas : ∃ (σ : Fin N ≃ Fin N) (s : Fin N → ℝ), Feasible r d l σ s) :
    ∃ (σ : Fin N ≃ Fin N) (s : Fin N → ℝ) (β : ℝ),
      Optimum r d l σ s ∧ 0 ≤ β ∧
        ∀ i, i ≠ n → (σ.symm i < σ.symm n ↔ d i ≤ β) := by sorry

end GTWSched.MaxDisc
Source
Garey, Tarjan & Wilfong, One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties, Math. Oper. Res. 13 (1988), p. 344, COROLLARY 1
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