A Memetic Algorithm for Multiskill Resource-Constrained Project Scheduling Problem under Linear Deterioration

Algorithm 3

Procedure crossover.

Input: Two parent solutions , ,

; Problem instance I

Output: The offspring

Set RA contains tasks remaining to be assigned

resource to and represents the size of .

fordo

ifthen

RARA

end if

end for

fornum  do

Assign randomly resource to

end for

Obtain and refine the offspring in the

same way as Algorithm 2/∗Section 4.3∗/