Proof of Proposition 1 — processing-volume lower bound
ProvedBurnInBatch.ListSched.volume_lower_boundbatch-processingmakespanp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling
Consider jobs with positive processing times , batch capacity , and identical parallel batch machines. If is the minimum makespan over all valid batchings and machine assignments, then
This lower bound compares the aggregate processing volume with the total batch capacity available across the machines. It is the volume estimate used in Proposition 1.
Formalization Note The paper uses one-based job indices; Lean uses Fin n. Job processing times are real and strictly positive. The optimal makespan ranges over all valid batchings, including partial and nonconsecutive batches.
Preamble
import Mathlib import Definitions.Def_BurnInBatch_ListSched_Model
Formal statement
namespace BurnInBatch.ListSched
/-- Proof of Proposition 1, p. 772: total job processing volume divided by `mB`
is a lower bound for the optimum batch makespan. -/
theorem volume_lower_bound {n : ℕ} (p : Fin n → ℝ) (B m : ℕ)
(hn : 0 < n) (hB : 0 < B) (hm : 0 < m)
(hp : ∀ j, 0 < p j) :
(∑ j : Fin n, p j) / ((m : ℝ) * (B : ℝ)) ≤
CmaxStar p B m Finset.univ := by sorry
end BurnInBatch.ListSched
Source
Lee, Uzsoy & Martin-Vega, Efficient Algorithms for Scheduling Semiconductor Burn-In Operations, Oper. Res. 40(4) (1992), p. 772, proof of Proposition 1, display “(1/mB) Σ p_i ≤ C_max*”; https://doi.org/10.1287/opre.40.4.764
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.