Justification of DP2 — some minimum-makespan schedule with is a consecutive partition
ProvedBurnInBatch.AgreeTmax.consecutive_optimalConsider jobs on a single batch processing machine of capacity , all available at time , with processing times and due dates , indexed so that
Fix . If the jobs have a batch schedule with , then among all such schedules there is one of minimum makespan that is a consecutive partition: each batch is a set of consecutively indexed jobs (of at most jobs), and the batches are processed in increasing order of index.
This is the step by which the paper reduces with agreeable processing times and due dates to a consecutive partition problem, which Algorithm DP2 solves.
Formalization Note The paper's "jobs are indexed in increasing order of due dates" (p. 767) is taken together with nondecreasing processing times. Agreeable data (strict form, ) always admit such an indexing (sort by due date, then by processing time), and the pair implies agreeability. With ties in broken against the DP of the next statement is wrong, which is why both orders are assumed. Minimality is over all valid schedules of the first jobs with .
import Mathlib import Definitions.Def_BurnInBatch_AgreeTmax_Model
namespace BurnInBatch.AgreeTmax
/-- Justification of Algorithm DP2 (p. 770, by reference to that of DP1, p. 768): with jobs
indexed so that due dates and processing times are both nondecreasing, if the jobs `1, …, j`
(`j ≤ n`) can be scheduled with `T_max = 0`, then among such schedules one of minimum makespan
is a consecutive partition: its batches are sets of consecutively indexed jobs, in increasing
order of index. -/
theorem consecutive_optimal {n B : ℕ} (hB : 0 < B) (p d : Fin n → ℕ)
(hd : Monotone d) (hp : Monotone p) (j : ℕ) (hj : j ≤ n)
(hfeas : ∃ S : List (Finset (Fin n)), IsValid B (jobsUpTo n j) S ∧ Tmax p d S = 0) :
∃ S : List (Finset (Fin n)), IsValid B (jobsUpTo n j) S ∧ Tmax p d S = 0 ∧
IsConsecutive S ∧
∀ S' : List (Finset (Fin n)), IsValid B (jobsUpTo n j) S' → Tmax p d S' = 0 →
makespan p S ≤ makespan p S' := by sorry
end BurnInBatch.AgreeTmax
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.