Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine

Algorithm 1

The optimization algorithm for the solution of the 1||∑𝜉_𝑗𝜂_[𝑗]+∑𝜓_[𝑗] problem.

Step  1. Calculate the 𝑐_𝑖𝑗 values by (5).

Step  2. Solve the assignment problem (𝑃1(𝑙)) to determine the optimal job sequence, and denote the resulting optimal sequence

      by 𝜋^∗=([1],[2],…,[𝑛]).