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

Table 12

For			For
#	Candidate solutions	Makespan	#	Candidate solutions	Makespan
1	2-1-6-4-3-5	571^‡	1	6-4-3-2-1-5	571^‡
2	2-1-6-4-5-3	571^‡	2	6-4-3-2-5-1	607
3	2-1-6-5-4-3	677	3	6-4-3-5-2-1	647
4	2-1-5-6-4-3	658	4	6-4-5-3-2-1	610
5	2-5-1-6-4-3	626	5	6-5-4-3-2-1	612
6	5-2-1-6-4-3	672	6	5-6-4-3-2-1	633

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