Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 233: only the B-job with the largest deadline needs to be considered

Proved
TwoAgentSched.largest_deadline

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

algorithm-analysisschedulingtwo-agent-scheduling

Let the deadlines DkBD^B_kDkB​ (cuts) represent the functions fkBf^B_kfkB​ and the bound QQQ. Let UUU be a set of B-jobs, k∗∈Uk^*\in Uk∗∈U one with the largest deadline in UUU, and τˉ≥0\bar\tau\ge0τˉ≥0. Then

∃ k∈U: fkB(τˉ)≤Q  ⟺  fk∗B(τˉ)≤Q.\exists\, k\in U:\ f^B_k(\bar\tau)\le Q \quad\iff\quad f^B_{k^*}(\bar\tau) \le Q .∃k∈U: fkB​(τˉ)≤Q⟺fk∗B​(τˉ)≤Q.

Hence, at each step of the algorithm, the only B-job that needs to be considered is the unscheduled one with the largest deadline.

Differences from the source:

  • generalization: a real deadline D^B_k with f^B_k(C) ≤ Q for C ≤ D^B_k and f^B_k(C) > Q for C > D^B_k → a cut D k : WithTop (ℝ ×ₗ Bool) with f^B_k(t) ≤ Q ↔ (t, true) ≤ D k for t ≥ 0 (IsDeadline); reason: the paper's real deadline need not exist (f = 0 on [0, 1) and 1 after, Q = 0); when it exists, (D^B_k, true) is such a cut (deadline_exists), so the statement specializes to the paper's
  • generalization: regular f^B_k → no monotonicity assumption on f^B_k; reason: only the representing property of the deadlines is used; regular functions are an instance
  • generalization: an integer Q → Q : ℝ; reason: integers are reals; nothing in the argument uses integrality
Preamble
import Mathlib
import Definitions.Def_TwoAgentSched_IsDeadline
Formal statement
namespace TwoAgentSched

/-- **Only the largest deadline matters** (Agnetis–Mirchandani–Pacciarelli–Pacifici, Oper. Res.
52(2) (2004), p. 233: "At each step the only B-job that needs to be considered is the
unscheduled one with largest `D^B_k`"). Let the deadlines `D k` represent `f^B_k` and `Q`, let
`U` be a set of B-jobs and `k* ∈ U` one with the largest deadline in `U`, and `τ̄ ≥ 0`. Then some
`k ∈ U` has `f^B_k(τ̄) ≤ Q` if and only if `f^B_{k*}(τ̄) ≤ Q`. -/
theorem largest_deadline {nB : ℕ} (fB : Fin nB → ℝ → ℝ) (Q : ℝ)
    (D : Fin nB → WithTop (ℝ ×ₗ Bool)) (hD : ∀ k, IsDeadline (fB k) Q (D k))
    (U : Finset (Fin nB)) (kstar : Fin nB) (hk : kstar ∈ U) (hmax : ∀ k ∈ U, D k ≤ D kstar)
    (τ : ℝ) (hτ : 0 ≤ τ) :
    (∃ k ∈ U, fB k τ ≤ Q) ↔ fB kstar τ ≤ Q := by sorry

end TwoAgentSched
Source
Agnetis, Mirchandani, Pacciarelli, Pacifici, Scheduling Problems with Two Competing Agents, Operations Research 52(2) (2004), p. 233 ("At each step the only B-job that needs to be considered is the unscheduled one with largest D^B_k")

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