Resource Constrained Project Scheduling Subject to Due Dates: Preemption Permitted with Penalty

Algorithm 1

SA algorithm.

𝑠← Generate initial solution ()

𝜂←𝜂₀

While stopping criteria not met do

 𝑠^′← Pick a solution in the vicinity of 𝑠 randomly

 If  𝑠^′ is better than 𝑠  then

    𝑠^′ replaces 𝑠

 Else

    Accept 𝑠^′ as new solution with probability exp−(𝑓(𝑠^′)−𝑓(𝑠))/𝜂

 End If

    Update (𝜂)

End While