Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4 — variable-time extension of DP3 minimizes tardy jobs

Proved
BurnInBatch.TardyJobs.dp3_variable_correct

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

batch-processingdynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

All jobs are available at time zero on one batch machine of capacity B≥1B\ge1B≥1. Their processing times pjp_jpj​ and due dates djd_jdj​ are both nondecreasing in job index. Let g(i,j)g(i,j)g(i,j) be the variable-time DP3 table using g(i−k,j−k)+pjg(i-k,j-k)+p_jg(i−k,j−k)+pj​ for a final on-time batch of kkk jobs when the result does not exceed dj−k+1d_{j-k+1}dj−k+1​. If U∗U^*U∗ is the minimum number of tardy jobs over complete valid batch schedules, then

U∗=n−max⁡{0≤i≤n:g(i,n)<+∞}.U^*=n-\max\{0\le i\le n:g(i,n)<+\infty\}.U∗=n−max{0≤i≤n:g(i,n)<+∞}.

This extends the algorithmic characterization to agreeable unequal processing times.

Formalization Note The paper prints a final range starting at one; zero is included to make the all-tardy case defined. Jobs are indexed so both ppp and ddd are nondecreasing. The stated O(n2B)O(n^2B)O(n2B) running-time bound is not formalized.

Preamble
import Mathlib
import Definitions.Def_BurnInBatch_TardyJobs_Model
import Definitions.Def_BurnInBatch_TardyJobs_DP3Variable
Formal statement
namespace BurnInBatch.TardyJobs

/-- The §4 extension of DP3, p. 771, to agreeable processing times and due dates. -/
theorem dp3_variable_correct {n : ℕ} (B : ℕ) (p d : Fin n → ℕ)
    (hB : 0 < B) (hd : Monotone d) (hp : Monotone p) :
    n - dp3VariableMaxOnTime B p d = minTardy B p (fun _ => 0) d := by sorry

end BurnInBatch.TardyJobs
Source
Lee, Uzsoy & Martin-Vega, Efficient Algorithms for Scheduling Semiconductor Burn-In Operations, Oper. Res. 40(4) (1992), p. 771, §4, extension of DP3 to 1/B/Σ U_i
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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