Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time

Algorithm 1

An heuristic based on Johnson’s rule.

	Input: % The initial sequence
	% Construction of
	, , ,
	% Sequence π on two virtual machines with new processing time
	for to do
	% Reconstruction of new two machines
	, , ,
	if then
	if then
	end if
	end if
	end for
	Output: