Multiobjective Resource-Constrained Project Scheduling with a Time-Varying Number of Tasks

Algorithm 1

Serial Schedule Generation Scheme (SSGS) Algorithm.

Procedure SSGS

Begin

  Determine a set 𝐸_𝑡 of eligible tasks

  For  𝑔=1 to 𝑁

     Randomly select a task ID 𝑗∈𝐸_𝑡

     Put this ID at genotype location 𝑔

     Find 𝑡 = max0,maxst_𝑖+𝑑^𝑟_𝑖∣𝑖∈Pred𝑗

     Schedule task with ID 𝑗 at the earliest precedence

       and resource-feasible start time 𝑡^′ > 𝑡

     Set st_𝑗 = 𝑡^′

     Update 𝐸_𝑡

  End

End