Rescheduling Problems with Agreeable Job Parameters to Minimize the Tardiness Costs under Deterioration and Disruption

Box 1

  Input: Given 𝑝_𝑗, 𝑑_𝑗 for 𝑗=1,…,𝑛; 𝑘 and 𝜋^∗, where 𝑘≤𝑛_𝑁.

  Indexing: Index the jobs of 𝐽_𝑁 in the EDD order.

  Schedule Construction: Schedule jobs 1,…,𝑛₀+𝑘 in the EDD order in the first 𝑛₀+𝑘 positions.

Schedule jobs 𝑛₀+𝑘+1,…,𝑛₀+𝑛_𝑁 in EDD order in the final 𝑛_𝑁−𝑘 positions.