Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The first infeasibility test — a disjunctive subset whose windows are shorter than its processing time

Proved
ComplexScheduling.disjunctive_set_infeasibility_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​], and let III be a disjunctive set for (C,D)(C,D)(C,D). If some nonempty subset J⊆IJ\subseteq IJ⊆I satisfies

max⁡μ∈Jdμ  −  min⁡ν∈Jrν  <  P(J)=∑i∈Jpi,\max_{\mu\in J}d_\mu\;-\;\min_{\nu\in J}r_\nu\;<\;P(J)=\sum_{i\in J}p_i ,μ∈Jmax​dμ​−ν∈Jmin​rν​<P(J)=i∈J∑​pi​,

then no feasible schedule exists: there is no schedule that is feasible for the RCPSP, respects the conjunctions CCC and the disjunctions DDD, and lies within the time windows.

This is the first infeasibility test of Section 3.6.4. The activities of JJJ cannot overlap, so they need P(J)P(J)P(J) units of time inside the interval [min⁡νrν,max⁡μdμ][\min_\nu r_\nu,\max_\mu d_\mu][minν​rν​,maxμ​dμ​], whose length is smaller.

Formalization Note The inequality between a maximum and a minimum is stated as the equivalent family of inequalities dμ<rν+P(J)d_\mu<r_\nu+P(J)dμ​<rν​+P(J) for all μ,ν∈J\mu,\nu\in Jμ,ν∈J, which avoids natural-number subtraction and needs no separate treatment of a negative difference. JJJ must be nonempty, as the maximum and minimum presuppose; for J=∅J=\emptysetJ=∅ the family is vacuous and the conclusion would be false. No positivity of the processing times is needed: a zero-length activity contributes nothing to P(J)P(J)P(J) and nothing to the packing.

Preamble
import Definitions.Def_ComplexScheduling_RCPSP
import Definitions.Def_ComplexScheduling_JobShop
import Definitions.Def_ComplexScheduling_ConstraintPropagation
Formal statement
namespace ComplexScheduling
theorem disjunctive_set_infeasibility_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)
    (J : Finset (Fin n)) (hJI : J ⊆ I) (hJ : J.Nonempty)
    (hcond : ∀ μ ∈ J, ∀ ν ∈ J, dl μ < rel ν + totalProcessing p J) :
    ¬ ∃ S : Fin n → ℕ, FeasibleSchedule p Rcap demand prec S ∧ RespectsArcs p C S ∧
      SatisfiesDisjunctions p D S ∧ WithinWindows rel dl p S := 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. 169 (PDF p. 179): "If there is a subset J ⊆ I with max_{μ∈J} d_μ − min_{ν∈J} r_ν < P(J), then obviously no feasible schedule exists since all jobs from the subset J have to be processed in the interval [min_{ν∈J} r_ν, max_{μ∈J} d_μ], which does not have the capacity P(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