Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 4, pp. 342–343 — some optimum schedule has the release time property w.r.t. a maximum-deadline task

Proved
GTWSched.MaxDisc.theorem_4

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 on one processor have lengths li≥0l_i \ge 0li​≥0, release times ri≥0r_i \ge 0ri​≥0 and deadlines did_idi​ in special form for a constant α≥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 a task with the largest deadline, di≤dnd_i \le d_ndi​≤dn​ for all iii. If a feasible schedule exists, then there is an optimum schedule (feasible, of minimum makespan among all feasible schedules) such that

every task Ti executed after Tn has ri>sn,\text{every task } T_i \text{ executed after } T_n \text{ has } r_i > s_n,every task Ti​ executed after Tn​ has ri​>sn​,

where sns_nsn​ is the starting time of TnT_nTn​; that is, the schedule has the release time property.

This is the key normalization result of §3.1; Corollaries 1 and 2 and the paper's algorithm for the maximum-discrepancy problem rest on it. For arbitrary release times and deadlines it is false: the special form is essential.

Formalization Note. Schedules are an execution order (a permutation of the task indices) plus starting times; "executed after" refers to that order. Tasks are indexed by Fin N.

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

theorem theorem_4 {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 ∧ ReleaseTimeProperty r σ 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), pp. 342–343, THEOREM 4
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