Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p. 344 — every task after T_N is released by the time T_N finishes

Proved
GTWSched.MaxDisc.release_le_finish

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

deadlinesp2o-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. In every feasible schedule, every task TiT_iTi​ executed after TnT_nTn​ satisfies

ri≤sn+ln,r_i \le s_n + l_n,ri​≤sn​+ln​,

i.e. it is released no later than the time at which TnT_nTn​ finishes.

The paper derives from this that there is no need for idle time after TNT_NTN​ starts and that the tasks after TNT_NTN​ can be taken in nondecreasing order of deadlines; both steps lead to the standard form.

Formalization Note. The paper states this for optimum schedules of the form given by Corollary 1. The statement here holds for every feasible schedule, since the argument uses only the special form, the maximality of dnd_ndn​ and rn≤snr_n \le s_nrn​≤sn​.

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

theorem release_le_finish {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) (σ : Fin N ≃ Fin N) (s : Fin N → ℝ)
    (hS : Feasible r d l σ s) :
    ∀ i, σ.symm n < σ.symm i → r i ≤ s n + l 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, paragraph after the proof of COROLLARY 1 ("In particular, this says that all tasks executed after T_N must have release times no greater than the time at which T_N finishes")
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