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

Algorithm 2

NEH algorithm.

	Input: processing time and the setup time in m machines.
	Evaluate the total processing time and setup time of each job by:
	Construct the sequence by sorting the jobs in descending order of
	Schedule the first two jobs , and choose the best sequence π of the first two jobs
	for to n do
	Insert in the all positions of the current sequence built and select the best sequence
	with the minimum in the last machine and update of the optimal sequence.
	end for
	Output: