Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

COROLLARY 2, p. 344 — if a feasible schedule exists, some optimum schedule is in standard form and has the release time property

Proved
GTWSched.MaxDisc.corollary_2

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​+α), indexed so that d0≤d1≤⋯≤dN−1d_0 \le d_1 \le \dots \le d_{N-1}d0​≤d1​≤⋯≤dN−1​; let TnT_nTn​, n=N−1n = N - 1n=N−1, be the last task. If a feasible schedule exists, then there are an optimum schedule (σ,s)(\sigma, s)(σ,s) and a split index jjj such that

(σ,s) is in standard form with split index j and has the release time property w.r.t. Tn.(\sigma, s) \text{ is in standard form with split index } j \text{ and has the release time property w.r.t. } T_n.(σ,s) is in standard form with split index j and has the release time property w.r.t. Tn​.

Standard form means: 0≤j≤N−10 \le j \le N - 10≤j≤N−1; the schedule begins with an optimum schedule of the tasks of index <j< j<j; then comes TnT_nTn​, starting at the maximum of rnr_nrn​ and the completion time of that first part; then the tasks of index j,…,N−2j, \dots, N-2j,…,N−2 in this order, without idle time. The release time property means every task after TnT_nTn​ has a release time strictly later than the start of TnT_nTn​.

This is the statement the paper's algorithm for minimizing the maximum discrepancy is built on: an optimum schedule for a prefix of the tasks is found among the standard-form candidates, one per split index, built from optimum schedules of shorter prefixes.

Formalization Note. Indices are 0-based. The paper's dummy task T0T_0T0​ (r0=d0=l0=0r_0 = d_0 = l_0 = 0r0​=d0​=l0​=0) is not a task; an empty first part (j=0j = 0j=0) completes at time 000. The split index jjj is the number of real tasks before TNT_NTN​, so its range 0≤j≤N−10 \le j \le N-10≤j≤N−1 is the paper's. Ties among deadlines are allowed; the standard form is relative to the given sorted indexing.

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

theorem corollary_2 {N : ℕ} (r d l : Fin N → ℝ) (α : ℝ) (hα : 0 ≤ α)
    (hr : ∀ i, 0 ≤ r i) (hl : ∀ i, 0 ≤ l i) (hsf : SpecialForm r d l α)
    (hd : Monotone d) (n : Fin N) (hnlast : n.val + 1 = N)
    (hfeas : ∃ (σ : Fin N ≃ Fin N) (s : Fin N → ℝ), Feasible r d l σ s) :
    ∃ (σ : Fin N ≃ Fin N) (s : Fin N → ℝ) (j : ℕ),
      Optimum r d l σ s ∧ StandardForm r d l σ s j ∧ 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), p. 344, COROLLARY 2 (standard form and split index defined in the paragraph before it)
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