A Study of Flexible Flow Shop Scheduling Problem with Various Heterogeneous Labors

Table 2

The optimal solution and makespan with  = 3, n = 5.

Amount of hired heterogeneous labors (E)	Arrangement of labors	Dispatching rule			Cmax	Optimum solution	CPU time
		( = 1, m = 3)	( = 2, m = 2)	( = 3, m = 2)		(Total cost)	(ms)
0	(7, 0, 0)	RRR	RR	RR	60.5	6352.5	—
1	(6, 0, 1)	RRR	RR	RO	61.56	6186.78	296.86
	(6, 1, 0)	RRR	RR	RD	61.94	6070.37	296.87
2	(5, 0, 2)	RRO	RR	RO	63.37	6083.76	265.62
	(5, 1, 1)	RRD	RR	RO	64.56	6036.36	297.34
	(5, 2, 0)	RRD	RR	RD	62.62	5698.42	281.24
3	(4, 0, 3)	RRO	RO	RO	63.86	5842.96	281.25
	(4, 1, 2)	RRO	RD	RO	64.46	5736.72	249.99
	(4, 2, 1)	RRD	RD	RO	60.84	5262.88	265.76
	(4, 3, 0)	RRD	RD	RD	66.36	5573.82	296.86
4	(3, 0, 4)	ROO	RO	RO	64.68	5626.94	218.74
	(3, 1, 3)	RDO	RO	RO	65.48	5532.64	249.99
	(3, 2, 2)	RDO	RD	RO	66.9	5485.96	249.99
	(3, 3, 1)	RDD	RD	RO	67.97	7306.78	249.99
	(3, 4, 0)	RDD	RD	RD	68.36	7177.28	249.99
5	(2, 0, 5)	ROO	OO	RO	67.85	7497.7	297.21
	(2, 1, 4)	ROO	DO	RO	68.09	7354.1	296.87
	(2, 2, 3)	RDO	DO	RO	67.9	7163.14	328.11
	(2, 3, 2)	RDO	DD	RO	68.41	7045.97	328.11
	(2, 4, 1)	RDD	DD	RO	68.71	6905.1	265.81
	(2, 5, 0)	RDD	DD	RD	69.86	6845.79	296.87
6	(1, 0, 6)	OOO	OO	RO	69.77	7395.09	484.36
	(1, 1, 5)	DOO	OO	RO	68.68	7107.86	281.24
	(1, 2, 4)	DOO	DO	RO	68.01	6869.26	312.49
	(1, 3, 3)	DDO	DO	RO	71.02	6994.98	281.24
	(1, 4, 2)	DDO	DD	RO	69.64	6684.96	234.74
	(1, 5, 1)	DDD	DD	RO	68.67	6420.88	415.25
	(1, 6, 0)	DDD	DD	RD	72.38	6586.49	389.7
7	(0, 0, 7)	OOO	OO	OO	71.17	7224.01	292.84
	(0, 1, 6)	OOO	OO	DO	71.17	7046.08	283.21
	(0, 2, 5)	DOO	OO	DO	71.17	6868.15	311.78
	(0, 3, 4)	DOO	DO	DO	71.17	6690.22	319
	(0, 4, 3)	DDO	DO	DO	78.53	9384.04	285.18
	(0, 5, 2)	DDO	DD	DO	71.46	6359.72	316.43
	(0, 6, 1)	DDD	DD	DO	73.82	8452.39	287.57
	(0, 7, 0)	DDD	DD	DD	77.17	8643.32	338.08

Note. The grey shading represents the minimal makespan among all combinations.