Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exactness of LBLBLB at depth n−1n-1n−1 (needed by the stopping rule, p. 402)

Proved
IgnallSchrage.MeanCompletion.lowerBound_eq_totalCompletion_of_terminal

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

branch-and-boundflow-shoplower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let Jn−1J_{n-1}Jn−1​ be a node that has scheduled n−1n-1n−1 of the nnn jobs, so that Jˉn−1={j}\bar J_{n-1}=\{j\}Jˉn−1​={j} is a single job, and let σ\sigmaσ be the full sequence Jn−1J_{n-1}Jn−1​ followed by jjj. Then

LB(Jn−1)=∑i=1ndi(σ).LB(J_{n-1})=\sum_{i=1}^{n}d_i(\sigma).LB(Jn−1​)=i=1∑n​di​(σ).

The paper's stopping rule declares a terminal node's sequence optimal as soon as the node is first on the list; that conclusion needs the bound of such a node to be the value of its sequence, which is this statement.

Formalization Note The paper does not state this for two machines; it is the general form of what its stopping rule (p. 402) relies on, and is labelled as such. It holds for arbitrary real processing times and also for n=1n=1n=1, where the node is the root (with dkd_kdk​ read as 000).

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

/-- Exactness of the bound at depth `n - 1` (needed by the stopping rule of p. 402): if the
node `J` has scheduled `n - 1` of the `n` jobs, then for the (unique) full sequence `σ` that
begins with `J`, `LB(J) = Σ_i d_i(σ)`. -/
theorem lowerBound_eq_totalCompletion_of_terminal {n : ℕ} (a b : Fin n → ℝ)
    (J : List (Fin n)) (hJ : J.length + 1 = n) (σ : Equiv.Perm (Fin n)) (hσ : IgnallSchrage.Makespan.BeginsWith σ J) :
    lowerBound a b J = totalCompletion a b σ := 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. 402, "The Branch-and-Bound Technique", stopping rule (general form needed for the bound of p. 406)
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