Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 406 — the sum of completion times over Jˉr\bar J_rJˉr​ is at least SrS_rSr​ of its order, hence at least S^r\hat S_rS^r​

Proved
IgnallSchrage.MeanCompletion.shat_le_sum_completion

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

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

Let 1≤r≤n−11\le r\le n-11≤r≤n−1, let JrJ_rJr​ be a node and let σ\sigmaσ be any full sequence that begins with JrJ_rJr​. Let (j1,…,jn−r)(j_1,\dots,j_{n-r})(j1​,…,jn−r​) be the order in which σ\sigmaσ processes the jobs of Jˉr\bar J_rJˉr​, and let di(σ)d_i(\sigma)di​(σ) be the completion times of σ\sigmaσ on machine BBB. Then

Sr(j1,…,jn−r) ≤ ∑i∈Jˉrdi(σ)andS^r ≤ ∑i∈Jˉrdi(σ).S_r(j_1,\dots,j_{n-r})\ \le\ \sum_{i\in\bar J_r}d_i(\sigma) \qquad\text{and}\qquad \hat S_r\ \le\ \sum_{i\in\bar J_r}d_i(\sigma).Sr​(j1​,…,jn−r​) ≤ i∈Jˉr​∑​di​(σ)andS^r​ ≤ i∈Jˉr​∑​di​(σ).

This is the second half of the bound LB(Jr)LB(J_r)LB(Jr​), and it holds whether or not machine BBB dominates.

Formalization Note The paper first describes SrS_rSr​ as "the sum of the completion times for the jobs in Jˉr\bar J_rJˉr​" when min⁡Jˉrbi≥max⁡Jˉrai\min_{\bar J_r}b_i\ge\max_{\bar J_r}a_iminJˉr​​bi​≥maxJˉr​​ai​. That description is not formalized as an equality: SrS_rSr​ uses min⁡Jˉrai\min_{\bar J_r}a_iminJˉr​​ai​ in place of aj1a_{j_1}aj1​​, so even under the condition the actual sum may exceed SrS_rSr​. What the paper uses, and what is stated, is the lower bound ("the actual sum of completion times will be ≥S^r\ge\hat S_r≥S^r​, no matter how the jobs in Jˉr\bar J_rJˉr​ are sequenced"). The bars over Jˉr\bar J_rJˉr​ in the subscripts of min⁡\minmin and max⁡\maxmax are invisible in the scan.

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

/-- p. 406: for a node `J = J_r` with `1 ≤ r ≤ n - 1` and every full sequence `σ` that begins
with `J`, whatever the order `l` in which `σ` processes `J̄_r`, `S_r(l) ≤ Σ_{i ∈ J̄_r} d_i(σ)`,
and hence `Ŝ_r ≤ Σ_{i ∈ J̄_r} d_i(σ)`. -/
theorem shat_le_sum_completion {n : ℕ} (a b : Fin n → ℝ) (J : List (Fin n))
    (hr : 1 ≤ J.length) (hrn : J.length < n) (σ : Equiv.Perm (Fin n)) (hσ : IgnallSchrage.Makespan.BeginsWith σ J) :
    Sval a b J ((List.ofFn σ).drop J.length) ≤ ∑ i ∈ IgnallSchrage.Makespan.unscheduled J, completionTime a b σ i ∧
    Shat a b J ≤ ∑ i ∈ IgnallSchrage.Makespan.unscheduled J, completionTime a b σ i := 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, "In the same way as with T_r, it should be evident that if the condition does not hold, the actual sum of completion times will be ≧Ŝ_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