Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times

Algorithm 1

NEH algorithm.

	Step 1: Jobs are sequenced by the decreasing order of their total processing time and obtain the sequence of jobs denoted by
	Step 2: Take the first two jobs of as the partial schedule and find the optimal schedule
	Step 3: Insert the next job of into the available positions of the previous partial schedule and find the partial schedule with the best objective function value
	Step 4: Repeat the process for the remaining jobs according to S