Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 406 — ordering Jˉr\bar J_rJˉr​ by increasing aia_iai​ attains T^r\hat T_rT^r​

Proved
IgnallSchrage.MeanCompletion.tval_eq_that_of_sorted

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

flow-shoplower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let JrJ_rJr​ be a node and (i1,…,in−r)(i_1,\dots,i_{n-r})(i1​,…,in−r​) an ordering of Jˉr\bar J_rJˉr​ with

ai1≤ai2≤⋯≤ain−r.a_{i_1}\le a_{i_2}\le\cdots\le a_{i_{n-r}}.ai1​​≤ai2​​≤⋯≤ain−r​​.

Then Tr(i1,…,in−r)=T^rT_r(i_1,\dots,i_{n-r})=\hat T_rTr​(i1​,…,in−r​)=T^r​, the minimum of TrT_rTr​ over all orderings of Jˉr\bar J_rJˉr​.

This makes T^r\hat T_rT^r​ computable by a sort instead of a minimization over (n−r)!(n-r)!(n−r)! orderings.

Formalization Note The ordering is a list that is a permutation of the list of the jobs of Jˉr\bar J_rJˉr​; "sorted" is List.Pairwise (fun i j => a i ≤ a j). The statement holds for any node, including the root.

Preamble
import Mathlib
import Definitions.Def_IgnallSchrage_MeanCompletion_LowerBound
Formal statement
namespace IgnallSchrage.MeanCompletion

/-- p. 406: an ordering `(i_1, …, i_{n-r})` of `J̄_r` with `a_{i_1} ≤ a_{i_2} ≤ ⋯ ≤ a_{i_{n-r}}`
attains the minimum `T̂_r` of `T_r` over all orderings of `J̄_r`. -/
theorem tval_eq_that_of_sorted {n : ℕ} (a b : Fin n → ℝ) (J : List (Fin n))
    (l : List (Fin n)) (hl : l ∈ orderings J) (hsort : l.Pairwise (fun i j => a i ≤ a j)) :
    Tval a b J l = That a b J := by sorry

end IgnallSchrage.MeanCompletion
Source
Ignall and Schrage, Application of the branch and bound technique to some flow-shop scheduling problems, Oper. Res. 13 (1965), p. 406, "Since T_r=constant+Σ_p (n−r−p+1)a_{i_p}, …"
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