Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times

Table 11

For			For
#	Candidate solutions	Makespan	#	Candidate solutions	Makespan
1	2-1-6-4-3-5	571^†	6	6-4-2-1-3-5	580
2	2-1-6-3-4-5	697	7	6-4-2-3-1-5	587
3	2-1-3-6-4-5	659	8	6-4-3-2-1-5	571^†
4	2-3-1-6-4-5	620	9	6-3-4-2-1-5	625
5	3-2-1-6-4-5	647	10	3-6-4-2-1-5	615

Best solution among all candidate solutions in this step.
^†Two different solutions have the same minimum makespan.