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

Algorithm 2

ESRA algorithm.

	Step 1: According to equation (13), calculate the summed energy consumption cost based on the setup time of each job and order the jobs in an ascending manner . Thus, obtain the sequence of jobs .
	Step 2: Take the first two jobs in and schedule them in the best objective function. Delete the two jobs in and save the best partial sequence OP.
	Step 3: From O = 3 to n, take the O-th job in and insert it into the O possible positions in OP. Then, select the best partial schedule. Finally, obtain the job processing order OP^∗.
	Step 4: According to OP^∗, schedule the jobs on the machines at each stage with EST rule.