Nature-Inspired Metaheuristics for Two-Agent Scheduling with Due Date and Release Time

Algorithm 1

Heuristic algorithm.

(1)	/ Initial Solution /
(2)	Create a partial sequence and
(3)	Create a solution //combine sequences and to construct
(4)	Calculate //Calculate the weighted number of tardy job for sequence
(5)	/ Feasibility phase /
(6)	for k =  to 1 do
(7)	Select job
(8)	for l = k+1 to  do
(9)
(10)	//Calculate the weighted number of tardy job for
(11)	ifthen
(12)	break l loop
(13)	end if
(14)	end for
(15)
(16)	if then
(17)	break k loop
(18)	end if
(19)	end for
(20)	return solution