Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of COROLLARY 1, p. 344 — with the release time property, the tasks before T_N are those with deadline ≤ t + α

Proved
GTWSched.MaxDisc.rtp_implies_deadline_split

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 (for every iii, either di−ri=li+αd_i - r_i = l_i + \alphadi​−ri​=li​+α, or ri=0r_i = 0ri​=0 and di<li+αd_i < l_i + \alphadi​<li​+α). Let TnT_nTn​ be any task and take a feasible schedule with the release time property with respect to TnT_nTn​; let t=snt = s_nt=sn​ be the starting time of TnT_nTn​. Then for every task Ti≠TnT_i \neq T_nTi​=Tn​,

Ti is executed before Tn  ⟺  di≤t+α.T_i \text{ is executed before } T_n \iff d_i \le t + \alpha.Ti​ is executed before Tn​⟺di​≤t+α.

The paper observes that its proof of Corollary 1 shows exactly this: every optimum schedule with the release time property splits the tasks around TNT_NTN​ by deadline, which is what the standard form and the algorithm of §3.2 exploit.

Formalization Note. The paper argues for optimum schedules with TNT_NTN​ of maximum deadline; the statement here is for every feasible schedule and every task TnT_nTn​, since the argument uses only feasibility, the special form and the release time property.

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

theorem rtp_implies_deadline_split {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) (σ : Fin N ≃ Fin N) (s : Fin N → ℝ)
    (hS : Feasible r d l σ s) (hrtp : ReleaseTimeProperty r σ s n) :
    ∀ i, i ≠ n → (σ.symm i < σ.symm n ↔ d i ≤ s n + α) := 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, proof of COROLLARY 1, and the remark "The proof of Corollary 1 actually showed that any optimum schedule with the release time property must have the form given in 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