Eq. (3.10) —
ProvedSingleMachineSched.AlphaSched.eq_3_10alpha-pointsp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling
Let jobs have integral processing times , integral release dates and weights , indexed by nonincreasing . Fix a job . Let be its start time in the LP schedule, the set of jobs processed in the LP schedule between the start and the completion of , and, for , the fraction of job processed before the start of job . Then
The identity expresses the LP mean busy time through the structure of the LP schedule around job ; it is the form in which the paper compares the expected completion time with .
Preamble
import Mathlib import Definitions.Def_SingleMachineSched_AlphaSched_AlphaPoints
Formal statement
namespace SingleMachineSched.AlphaSched
/-- Eq. (3.10) (Goemans et al. 2002, p. 182): in the LP schedule,
`M^LP_j = t_j(0⁺) + Σ_{k ∈ N₂} (1 - μ_k) p_k + p_j / 2`. -/
theorem eq_3_10 {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 = startTime (lpSet p r) j +
∑ k ∈ N2 p r j, (1 - mu p r j k) * (p k : ℝ) + (p j : ℝ) / 2 := by sorry
end SingleMachineSched.AlphaSched
Source
Goemans, Queyranne, Schulz, Skutella & Wang, Single Machine Scheduling with Release Dates, SIAM J. Discrete Math. 15(2) (2002), p. 182, Eq. (3.10)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.