Eq. (3.1) —
ProvedSingleMachineSched.AlphaJSched.eq_3_1p2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling
Let jobs have integral processing times , integral release dates and weights , indexed in nonincreasing order of . For every job , the mean busy time of in the LP schedule is the average of its -points:
This identity turns a bound on the completion time of that is linear in into a bound in terms of after integrating over a random .
Formalization Note. The integral is the Lebesgue integral over of , the -points taken in the LP schedule. The identity does not use the weights or their order; they are the paper's standing assumptions and are kept as hypotheses.
Preamble
import Mathlib import Definitions.Def_SingleMachineSched_AlphaJSched_LPSchedule import Definitions.Def_SingleMachineSched_AlphaJSched_AlphaPoints
Formal statement
namespace SingleMachineSched.AlphaJSched
/-- Equation (3.1): the mean busy time of job `j` in the LP schedule is the average of its
`α`-points over `α ∈ (0, 1]`. -/
theorem eq_3_1 {n : ℕ} (p r : Fin n → ℕ) (w : Fin n → ℝ)
(hp : ∀ j, 0 < p j) (hw : ∀ j, 0 < w j)
(hsort : ∀ j k : Fin n, j ≤ k → w k / p k ≤ w j / p j) (j : Fin n) :
mLP p r j = ∫ a in Set.Ioc (0 : ℝ) 1, alphaPoint p (lpSet p r) j a := by sorry
end SingleMachineSched.AlphaJSched
Source
Goemans, Queyranne, Schulz, Skutella & Wang, Single Machine Scheduling with Release Dates, SIAM J. Discrete Math. 15(2) (2002), p. 176, Section 3, Eq. (3.1)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.