Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 333 — a minimum cost schedule with a common preferred midtime is ordered

Proved
GTWSched.NPC.min_cost_ordered

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

earliness-tardinessp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schedulingsingle-machine

In the setting of the special case (tasks T0,…,T2nT_0,\dots,T_{2n}T0​,…,T2n​, 0<l0<l1<⋯<l2n0<l_0<l_1<\dots<l_{2n}0<l0​<l1​<⋯<l2n​, common preferred midtime M>∑i=02nliM>\sum_{i=0}^{2n}l_iM>∑i=02n​li​), every minimum cost schedule SSS is ordered: with A(S)={Ti:mi(S)<M}A(S)=\{T_i:m_i(S)<M\}A(S)={Ti​:mi​(S)<M} and B(S)={Ti:mi(S)>M}B(S)=\{T_i:m_i(S)>M\}B(S)={Ti​:mi​(S)>M},

Ti,Tj∈A(S), li<lj ⇒ mi(S)>mj(S),Ti,Tj∈B(S), li<lj ⇒ mi(S)<mj(S).T_i,T_j\in A(S),\ l_i<l_j\ \Rightarrow\ m_i(S)>m_j(S),\qquad T_i,T_j\in B(S),\ l_i<l_j\ \Rightarrow\ m_i(S)<m_j(S).Ti​,Tj​∈A(S), li​<lj​ ⇒ mi​(S)>mj​(S),Ti​,Tj​∈B(S), li​<lj​ ⇒ mi​(S)<mj​(S).

Shorter tasks are scheduled nearer to MMM on each side.

Formalization Note Tasks are Fin (2n+1); schedules have nonnegative starting times.

Preamble
import Mathlib
import Definitions.Def_GTWSched_NPC_Schedules
Formal statement
namespace GTWSched.NPC

/-- p. 333: in the special case (tasks `T₀, …, T₂ₙ` with `0 < l₀ < l₁ < ⋯ < l₂ₙ` and one common
preferred midtime `M > ∑ᵢ lᵢ`), a minimum cost schedule is ordered. -/
theorem min_cost_ordered {n : ℕ} (l : Fin (2 * n + 1) → ℝ) (M : ℝ) (hl0 : 0 < l 0)
    (hmono : StrictMono l) (hM : ∑ i, l i < M) (s : Fin (2 * n + 1) → ℝ)
    (hs : IsMinCost l M s) : Ordered l M s := by sorry

end GTWSched.NPC
Source
Garey, Tarjan & Wilfong, One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties, Math. Oper. Res. 13 (1988), p. 333, §2.1, "It is easy to show that for any minimum cost schedule …"
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