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

Algorithm 4

Iterated greedy algorithm.

	Input: π the initial sequence.
	while do
	for to d do
	Extract a job at random from the sequence and add the job to the subset.
	end for
	for to d do
	Extract the job from subset.
	Test the job on all positions in the current sequence and choose the best position giving the best completion time.
	end for
	Choose from the neighborhood of
	if then
	if then
	end if
	else
	if then
	end if
	end if
	end while
	Output: