Effective Evolutionary Algorithm for Solving the Real-Resource-Constrained Scheduling Problem

Algorithm 1

R-CSM algorithm.

	input: maxGeneration
iMOPSE datasets
output: makespan of project
(1)	Begin
(2)
(3)	Size ⟵ number of individuals (i.e. possible schedules)
(4)	⟵ the first population
(5)	⟵ the fitness, b_plan(bestnest), makespan
(6)
(7)	While (t < max_gen)
(8)	n_plan ⟵ create new nest by Lévy Flight
(9)	r_plan ⟵ Select random nest from
(10)	If (f(n_plan) < (r_plan))
(11)	r_plan = n_plan
(12)	End if
(13)	⟵ Remove pa worst nest and replace by new nests, new nests created by Lévy Flight
(14)	⟵ the fitness, b_plan, makespan
(15)	b_plan ⟵ Reallocate(b_plan)//schedule b_plan is improved by the//function Reallocate(), which is described in the next subsection in details.
(16)
(17)	End while
(18)	return makespan
(19)	End