The schedules are evaluated as per to the criterion weighted loss of slack. Now let t0si be the slack (time buffer) of job I as per to the initial schedule and tsi (n) be the slack of the job i after the continuation number n.
The parameter p was set to 10 and q was set to the length of all continuations. Beginning from partial original schedule, 100 various continuations were generated in this way that is two continuation steps were presented. The initial operation of the excellent schedule was allocated to offer the new partial schedule.
The heuristics that were tested in the reduction of the sets S (m) were slack per remaining operation (S/OPN) and simple slack (SL). S/OPN twisted out to be more effectual.