Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 411 — on two machines, adding GGG raises ∑idi\sum_i d_i∑i​di​ of every sequence by 12Gn(n+3)\tfrac12 Gn(n+3)21​Gn(n+3)

Proved
IgnallSchrage.Invariance.sumCompletion_shift

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

flow-shopp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Consider nnn jobs on two machines with nonnegative processing times ai,bia_i,b_iai​,bi​, and let G>0G>0G>0. Write ∑idi(σ)\sum_i d_i(\sigma)∑i​di​(σ) for the sum of the completion times of the full sequence σ\sigmaσ, and ∑id~i(σ)\sum_i \tilde d_i(\sigma)∑i​d~i​(σ) for the same sum after adding GGG to every processing time. Then for every σ\sigmaσ

∑id~i(σ)=∑idi(σ)+∑r=1nG(r+1)=∑idi(σ)+12 G n(n+3).\sum_i \tilde d_i(\sigma)=\sum_i d_i(\sigma)+\sum_{r=1}^{n}G(r+1)=\sum_i d_i(\sigma)+\tfrac12\,G\,n(n+3).i∑​d~i​(σ)=i∑​di​(σ)+r=1∑n​G(r+1)=i∑​di​(σ)+21​Gn(n+3).

The same constant is added to the value of every sequence, so the set of optimal sequences is unchanged.

Formalization Note Nonnegative processing times are assumed, as for the completion-time shift.

Preamble
import Mathlib
import Definitions.Def_IgnallSchrage_Invariance_TwoMachine
Formal statement
namespace IgnallSchrage.Invariance

/-- p. 411: on two machines, adding `G` to all processing times (all nonnegative) raises the sum of the
completion times of every sequence by `Σ_{r=1}^{n} G (r + 1) = ½ G n (n + 3)`. -/
theorem sumCompletion_shift {n : ℕ} (a b : Fin n → ℝ)
    (ha : ∀ i, 0 ≤ a i) (hb : ∀ i, 0 ≤ b i) (G : ℝ) (hG : 0 < G)
    (σ : Equiv.Perm (Fin n)) :
    sumCompletion (fun i => a i + G) (fun i => b i + G) σ =
      sumCompletion a b σ + G * n * (n + 3) / 2 := by sorry

end IgnallSchrage.Invariance
Source
Ignall and Schrage, Application of the branch and bound technique to some flow-shop scheduling problems, Oper. Res. 13 (1965), p. 411, Appendix, proof of the THEOREM (sum of the completion times increased by ½Gn(n+3))
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