Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 406 — ordering Jˉr\bar J_rJˉr​ by increasing bjb_jbj​ attains S^r\hat S_rS^r​

Proved
IgnallSchrage.MeanCompletion.sval_eq_shat_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 (j1,…,jn−r)(j_1,\dots,j_{n-r})(j1​,…,jn−r​) an ordering of Jˉr\bar J_rJˉr​ with

bj1≤bj2≤⋯≤bjn−r.b_{j_1}\le b_{j_2}\le\cdots\le b_{j_{n-r}}.bj1​​≤bj2​​≤⋯≤bjn−r​​.

Then Sr(j1,…,jn−r)=S^rS_r(j_1,\dots,j_{n-r})=\hat S_rSr​(j1​,…,jn−r​)=S^r​, the minimum of SrS_rSr​ over all orderings of Jˉr\bar J_rJˉr​.

Together with the previous statement, this makes LB(Jr)LB(J_r)LB(Jr​) computable with two sorts.

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 => b i ≤ b 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 `(j_1, …, j_{n-r})` of `J̄_r` with `b_{j_1} ≤ b_{j_2} ≤ ⋯ ≤ b_{j_{n-r}}`
attains the minimum `Ŝ_r` of `S_r` over all orderings of `J̄_r`. -/
theorem sval_eq_shat_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 => b i ≤ b j)) :
    Sval a b J l = Shat 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, "S_r=constant+Σ_{p=1}^{n−r}(n−r−p+1)b_{j_p} so it is clear that choosing a sequence so that b_{j_1}≦⋯≦b_{j_{n−r}} will minimize S_r"
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