Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Output test (3.124) — an activity that must be scheduled last in Ω ∪ {i}

Proved
ComplexScheduling.output_test

by naimengye · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsconstraint-propagationoperations-researchoptimizationscheduling

Consider an RCPSP instance with conjunction set CCC, disjunction set DDD and time windows [ri,di][r_i,d_i][ri​,di​], let III be a disjunctive set for (C,D)(C,D)(C,D) whose activities have positive processing times, let Ω⊆I\Omega\subseteq IΩ⊆I be nonempty and let i∈I∖Ωi\in I\setminus\Omegai∈I∖Ω. If

max⁡μ∈Ωdμ  −  min⁡ν∈Ω∪{i}rν  <  P(Ω)+pi,\max_{\mu\in\Omega}d_\mu\;-\;\min_{\nu\in\Omega\cup\{i\}}r_\nu\;<\;P(\Omega)+p_i ,μ∈Ωmax​dμ​−ν∈Ω∪{i}min​rν​<P(Ω)+pi​,

then in every feasible schedule — feasible for the RCPSP, satisfying CCC and DDD, within the windows — every activity of Ω\OmegaΩ is processed before iii: Sj+pj≤SiS_j+p_j\le S_iSj​+pj​≤Si​ for all j∈Ωj\in\Omegaj∈Ω. In the book's notation, Ω→i\Omega\to iΩ→i: iii is an output of Ω∪{i}\Omega\cup\{i\}Ω∪{i}.

This is the output test, the instance J′=∅J'=\emptysetJ′=∅, J′′={i}J''=\{i\}J′′={i} of Theorem 3.7, and the mirror image of the input test: if some μ∈Ω\mu\in\Omegaμ∈Ω ended last, all of Ω∪{i}\Omega\cup\{i\}Ω∪{i} would have to fit between the smallest head and dμd_\mudμ​, an interval too short for P(Ω)+piP(\Omega)+p_iP(Ω)+pi​; so iii ends last, and since it cannot overlap any j∈Ωj\in\Omegaj∈Ω, jjj finishes before iii starts.

Formalization Note The condition is the family dμ<rν+P(Ω∪{i})d_\mu<r_\nu+P(\Omega\cup\{i\})dμ​<rν​+P(Ω∪{i}) over μ∈Ω\mu\in\Omegaμ∈Ω, ν∈Ω∪{i}\nu\in\Omega\cup\{i\}ν∈Ω∪{i}. Positive processing times on III are what turn "ends last" into the conjunctions j→ij\to ij→i, exactly as in the input test.

Preamble
import Definitions.Def_ComplexScheduling_RCPSP
import Definitions.Def_ComplexScheduling_JobShop
import Definitions.Def_ComplexScheduling_ConstraintPropagation
Formal statement
namespace ComplexScheduling
theorem output_test {n r : ℕ} (p : Fin n → ℕ) (Rcap : Fin r → ℕ)
    (demand : Fin n → Fin r → ℕ) (prec C D : Finset (Fin n × Fin n)) (rel dl : Fin n → ℕ)
    (I : Finset (Fin n)) (hI : IsDisjunctiveSet C D I) (hp : ∀ i ∈ I, 0 < p i)
    (Ω : Finset (Fin n)) (hΩ : Ω ⊆ I) (hne : Ω.Nonempty) (i : Fin n) (hi : i ∈ I) (hiΩ : i ∉ Ω)
    (hcond : ∀ μ ∈ Ω, ∀ ν ∈ insert i Ω, dl μ < rel ν + totalProcessing p (insert i Ω))
    (S : Fin n → ℕ) (hS : FeasibleSchedule p Rcap demand prec S) (hC : RespectsArcs p C S)
    (hD : SatisfiesDisjunctions p D S) (hw : WithinWindows rel dl p S) :
    ∀ j ∈ Ω, S j + p j ≤ S i := by sorry
end ComplexScheduling
Source
Peter Brucker and Sigrid Knust, Complex Scheduling, 2nd ed., Springer 2012, https://doi.org/10.1007/978-3-642-23929-8 — Section 3.6.4, printed p. 170 (PDF p. 180), the output test, and printed p. 171 (PDF p. 181), implication (3.124): "Symmetrically, max_{μ∈Ω} d_μ − min_{ν∈Ω∪{i}} r_ν < P(Ω) + p_i ⇒ Ω → i, i.e. i has to be scheduled last in Ω ∪ {i}. ... in the case (3.124) we may introduce the additional conjunctions j → i for all j ∈ Ω."
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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