Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(24), Lemma 4.2, p. 21 — ∑ⱼ wⱼCⱼ ≥ ∑ⱼ wⱼ ∑_{i,k} a_{i_k j} p_ij for every preemptive schedule

Proved
SkutellaCQP.Preempt.lemma_4_2_24

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

lower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1preemptionschedulingweighted-completion-time

Consider an instance of R∣rij, pmtn∣∑wjCjR\mid r_{ij},\,pmtn\mid\sum w_jC_jR∣rij​,pmtn∣∑wj​Cj​: jobs jjj with weights wj≥0w_j\ge0wj​≥0, processing times pij>0p_{ij}>0pij​>0 and release dates rij≥0r_{ij}\ge0rij​≥0 on unrelated machines iii. Let SSS be a feasible preemptive schedule with completion times CjC_jCj​, and let aikja_{i_kj}aik​j​ be the fraction of job jjj processed on machine iii within the time slot [ρik,ρik+1)[\rho_{i_k},\rho_{i_{k+1}})[ρik​​,ρik+1​​). Then

∑jwjCj ≥ ∑jwj∑i,kaikj pij.\sum_j w_jC_j\ \ge\ \sum_j w_j\sum_{i,k}a_{i_kj}\,p_{ij}.j∑​wj​Cj​ ≥ j∑​wj​i,k∑​aik​j​pij​.

This is the second bound (24) of Lemma 4.2. The right-hand side is the weighted sum of the processing times spent on each job in the schedule; it is the right-hand side of constraint (27) of the relaxation (CQPp′)(CQP'_p)(CQPp′​).

Formalization Note The schedule, the fractions aikja_{i_kj}aik​j​ and ρ\rhoρ are those of SkutellaCQP.Preempt.Setting. Feasibility includes that a job is never processed on two machines at once; this bound needs it.

Preamble
import Mathlib
import Definitions.Def_SkutellaCQP_Preempt_Setting
Formal statement
namespace SkutellaCQP.Preempt

open Finset

theorem lemma_4_2_24 {m n : ℕ} (p : Fin m → Fin n → ℝ) (w : Fin n → ℝ) (r : Fin m → Fin n → ℝ)
    (hp : ∀ i j, 0 < p i j) (hw : ∀ j, 0 ≤ w j) (hr : ∀ i j, 0 ≤ r i j)
    (P : PSched m n) (hP : PFeasible p r P) :
    rhs24 p w (frac p r P) ≤ pval w P := by sorry

end SkutellaCQP.Preempt
Source
Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM 48 (2001), p. 21, Lemma 4.2, display (24)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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